개인구독
소속 기관이 없으신 경우, 개인 정기구독을 하시면 저렴하게
논문을 무제한 열람 이용할 수 있어요.
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2023.5
- 수록면
- 55 - 63 (9page)
- DOI
- 10.25052/KSCM.2023.05.22.1.55
이용수
초록· 키워드
오류제보하기
We consider two just-in-time scheduling problems in a single-machine environment, where the due dates are not job-dependent but position-dependent. A job can be rejected or accepted, and the processing time of the accepted jobs can be reduced according to a decreasing convex function of the resource consumption amount. Some cost occurs for rejecting jobs and reducing the processing times of the accepted jobs. The performance measure of the accepted jobs is the total benefit of the just-in-time jobs. The first objective is to maximize the total benefit minus the total rejection cost with a constraint on the total resource consumption cost, and the second is to maximize the total benefit minus the sum of the total rejection and the total resource consumption costs. We show that the first problem is weakly NP-hard, and polynomially solvable if the benefit and the rejection cost of each job are identical. Furthermore, we show that the second problem is polynomially solvable by reducing it to the shortest path problem.
목차
1. Introduction
2. Literature Review
3. Results
4. Concluding Rem arks
REFERENCES
참고문헌 (45)
참고문헌 신청
Ahuja, R. K., Mehlhorn, K., Orlin, J., & Tarjan, R. E. (1990). Faster algorithms for the shortest path problem. Journal of the ACM, 37, 213-223.
Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., & Stougie, L. (2000). Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics, 13, 64-78.
Cao, Z. G. & Zhang, Y. Z. (2007). Scheduling with rejection and nonidentical job arrivals. Journal of Systems Science and Complexity, 20, 529-535.
Cheng, T. C. E. & Janiak, A. (2000). A permutation flow-shop scheduling problem with convex models of operation processing times. Annals of Operations Research, 96, 39-60.
Choi, B. C. (2022). A single-machine scheduling problem with convex resource consumption functions and rejection. Journal of the Korean Society of Supply Chain Management, 22, 11-18.
Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., & Stougie, L. (2000). Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics, 13, 64-78.
Cao, Z. G. & Zhang, Y. Z. (2007). Scheduling with rejection and nonidentical job arrivals. Journal of Systems Science and Complexity, 20, 529-535.
Cheng, T. C. E. & Janiak, A. (2000). A permutation flow-shop scheduling problem with convex models of operation processing times. Annals of Operations Research, 96, 39-60.
Choi, B. C. (2022). A single-machine scheduling problem with convex resource consumption functions and rejection. Journal of the Korean Society of Supply Chain Management, 22, 11-18.
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
A Single-machine Scheduling Problem with Convex Resource Consumption Functions and Rejection
한국 SCM 학회지
2022 .05
-
A Just-in-time Scheduling Problem with Generalized Due Dates and Controllable Processing Times
한국 SCM 학회지
2020 .05
-
A Two-Agent Single-Machine Scheduling Problem with Periodic and Common Due Dates
대한산업공학회지
2020 .10
-
Two-Agent Single-Machine Scheduling with Linear Job-Dependent Position-Based Learning Effects
산업경영시스템학회지
2015 .01
-
지연 스케쥴을 허용하는 납기최소화 잡샵 스케쥴링 알고리즘
산업경영시스템학회지
2019 .01
-
의료기관 종사자의 직무만족 및 직무성과에 미치는 직무스트레스 영향요인
보건정보통계학회지
2019 .01
-
A time-cost tradeoff problem with multiple interim assessments under the precedence graph with two chains in parallel
한국컴퓨터정보학회논문지
2018 .03
-
Robust single-machine scheduling with uncertain processing times
대한산업공학회 춘계공동학술대회 논문집
2017 .04
-
Decision Tree based Scheduling for Static and Dynamic Flexible Job Shops with Multiple Process Plans
Journal of the Korean Society for Precision Engineering
2015 .01
-
A parallel machine scheduling problem with release dates, equal processing times, and eligibility constraints
대한산업공학회 추계학술대회 논문집
2017 .11
-
Scheduling algorithms for two-stage assembly job-shop-type remanufacturing systems with job families
대한산업공학회 춘계공동학술대회 논문집
2016 .04
-
A permutation flow shop scheduling with convex resource consumption functions
대한산업공학회 춘계공동학술대회 논문집
2022 .06
-
A Branch-and-Bound for Production-and-Delivery Scheduling with Dynamic Delivery Cost Allowed
Industrial Engineering & Management Systems
2018 .06
-
강화학습을 활용한 작업 분할이 가능하고 설비 제약이 존재하는 동종 병렬 시스템의 총 납기 지연 최소화
대한산업공학회지
2023 .12
-
A Study of Job Failure Prediction on Supercomputers with Application Semantic Enhancement
Journal of Computing Science and Engineering
2022 .12
-
Good Job 건축시공
건축
2021 .03
-
A Special Case of Three Machine Flow Shop Scheduling
Industrial Engineering & Management Systems
2016 .03
-
대학생의 직업가치관 유형 및 직업기초능력
한국컴퓨터정보학회논문지
2018 .05
-
Dynamic Job Shop Scheduling using Imitation Learning
대한산업공학회 춘계공동학술대회 논문집
2022 .06
-
Reinforcement Learning Approach for Flexible Job-Shop Scheduling Problem
대한산업공학회 추계학술대회 논문집
2019 .11
이 논문의 저자 정보
최근 본 자료
댓글(0)
0