Single machine serial-batching scheduling with independent setup time and deteriorating job processing times

被引：0
作者：
Jun Pei
Xinbao Liu
Panos M. Pardalos
Wenjuan Fan
Shanlin Yang
机构：
[1] Hefei University of Technology,School of Management
[2] University of Florida,Department of Industrial and Systems Engineering, Center for Applied Optimization
[3] Key Laboratory of Process Optimization and Intelligent Decision-Making of Ministry of Education,Laboratory of Algorithms and Technologies for Networks Analysis
[4] National Research University Higher School of Economics,Department of Computer Science
[5] North Carolina State University,undefined
来源：
Optimization Letters | 2015年 / 9卷
关键词：
Serial-batching scheduling; Deteriorating jobs; Single machine; Setup time;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：91 / 104
页数：13
相关论文
共 56 条
  • [1] Gupta J.N.D.(1988)Single facility scheduling with nonlinear processing times Comput. Ind. Eng. 14 387-393
  • [2] Gupta S.K.(1990)Scheduling deteriorating jobs on a single processor Oper. Res. 38 495-498
  • [3] Browne S(2009)Single machine parallel-batch scheduling with deteriorating jobs Theor. Comput. Sci. 410 830-836
  • [4] Yechiali U(2011)Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan Eur. J. Oper. Res. 210 482-488
  • [5] Qi XL(2011)Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs Inf. Process. Lett. 111 798-803
  • [6] Zhou SG(2012)Scheduling of deteriorating jobs with release dates to minimize the maximum lateness Theor. Comput. Sci. 462 80-87
  • [7] Yuan JJ(2008)Single-machine group scheduling problems with deterioration consideration Comput. Oper. Res. 35 1652-1659
  • [8] Li SS(2008)Single-machine group-scheduling problems with deteriorating setup times and job-processing times Int. J. Prod. Econ. 115 128-133
  • [9] Ng CT(2008)Single-machine group scheduling problems with deteriorating jobs Int. J. Adv. Manuf. Technol. 39 808-812
  • [10] Cheng TCE(2009)Single machine group scheduling with general linear deterioration to minimize the makespan Int. J. Adv. Manuf. Technol. 43 146-150
123456