Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
- 520 Downloads
This paper investigates the scheduling problems of a single serial-batching machine with independent setup time and deteriorating job processing times. With the assumption of deteriorating jobs, the job processing times are described by an increasing function of their starting times. All the jobs are first partitioned into serial batches and then processed on a single serial-batching machine. Before each batch is processed, an independent constant setup time is required. Two optimization algorithms are proposed to solve the problems of minimizing the makespan and the total number of tardy jobs, respectively. Specifically, for the problem of minimizing the total completion time, two special cases with the smallest and the largest number of batches are studied, and an optimization algorithm is also presented for the special case without setup time.
KeywordsSerial-batching scheduling Deteriorating jobs Single machine Setup time
We would like to thank the editors and referees for their valuable comments and suggestions. This work is supported by the National Natural Science Foundation of China (Nos. 71231004, 71171071, 71131002), and LATNA laboratory, NRU HSE, RF government grant, ag. 11.G34.31.0057.
- 1.Gupta, J.N.D., Gupta, S.K.: Single facility scheduling with nonlinear processing times. Comput. Ind. Eng. 14, 387–393 (1988)Google Scholar
- 20.Wang, D., Huo, Y.Z., Ji, P.: Single-machine group scheduling with deteriorating jobs and allotted resource. Optim. Lett. (2012). doi: 10.1007/s11590-012-0577-2