Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Branch and Bound Algorithm for Single Machine Scheduling with Step-Improving Jobs

계단형 향상 작업을 갖는 단일설비 스케줄링을 위한 분기한정 알고리즘

  • Jun-Ho Lee (School of Business, Chungnam National University)
  • 이준호 (충남대학교 경상대학 경영학부)
  • Received : 2024.04.02
  • Accepted : 2024.04.18
  • Published : 2024.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

We examine a single machine scheduling problem with step-improving jobs in which job processing times decrease step-wisely over time according to their starting times. The objective is to minimize total completion time which is defined as the sum of completion times of jobs. The total completion time is frequently considered as an objective because it is highly related to the total time spent by jobs in the system as well as work-in-progress. Many applications of this problem can be observed in the real world such as data gathering networks, system upgrades or technological shock, and production lines operated with part-time workers in each shift. Our goal is to develop a scheduling algorithm that can provide an optimal solution. For this, we present an efficient branch and bound algorithm with an assignment-based node design and tight lower bounds that can prune branch and bound nodes at early stages and accordingly reduce the computation time. In numerical experiments well designed to consider various scenarios, it is shown that the proposed algorithm outperforms the existing method and can solve practical problems within reasonable computation time.

Keywords

Acknowledgement

This work was supported by Chungnam National University.

References

  1. Berlinska, J., Scheduling for Data Gathering Networks with Data Compression, European Journal of Operational Research, 2015, Vol. 246, No. 3, pp. 744-749.
  2. Cheng, T. and Ding, Q., Single Machine Scheduling with Step-deteriorating Processing Times, European Journal of Operational Research, 2001, Vol. 134, No. 3, pp. 623-630.
  3. Cheng, T., He, Y., Hoogeveen, H., Ji, M., and Woeginger, G. J., Scheduling with Step-improving Processing Times, Operations Research Letters, 2006, Vol. 34, No. 1, pp. 37-40.
  4. Gawiejnowicz, S., A Review of Four Decades of Time-dependent Scheduling: Main Results, New Topics, and Open Problems, Journal of Scheduling, 2020, Vol. 23, No. 1, pp. 3-47.
  5. Ji, M., He, Y., and Cheng, T., A Simple Linear Time Algorithm for Scheduling with Step-improving Processing Times, Computers & Operations Research, 2007, Vol. 34, No. 8, pp. 2396-2402.
  6. Kim, E.-S., Choi, B.-C., Lee, J.-H., and Kim, H.-J., Scheduling of Step-improving Jobs with Multiple Critical dates, Technical Report, 2023.
  7. Kim, E.-S. and Oron, D., Minimizing Total Completion Time on a Single Machine with Step Improving Jobs, Journal of the Operational Research Society, 2015, Vol. 66, No. 9, pp. 1481-1490.
  8. Kim, H.-J., Kim, E.-S., and Lee, J.-H., Scheduling of Step-improving Jobs with an Identical Improving Rate, Journal of the Operational Research Society, 2022, Vol. 73, No. 5, pp. 1127-1136.
  9. Li, K., Chen, J., Fu, H., Jia, Z., and Wu, J., Parallel Machine Scheduling with Position-based Deterioration and Learning Effects in an Uncertain Manufacturing System, Computers & Industrial Engineering, 2020, Vol. 149, pp. 1-12.
  10. Luo, W., Gu, B., and Lin, G., Communication Scheduling in Data Gathering Networks of Heterogeneous Sensors with Data Compression: Algorithms and Empirical Experiments, European Journal of Operational Research, 2018, Vol. 271, No. 2, pp. 462-473.
  11. Sundararaghavan, P.S. and Kunnathur, A.S., Single Machine Scheduling with Start Time Dependent Processing Times: Some Solvable Cases, European Journal of Operational Research, 1994, Vol. 78, No. 3, pp. 394-403.