New Results on Multitasking via Alternate Period Processing

This paper is motivated by disruptions that occur when jobs are processed by human instead of machine. For mitigating the loss of productivity, we study a single machine scheduling problem with alternate periods including odd period and even-period. In this problem, we consider continuous processing, which means preemption is not allowed. Two objectives are considered: makespan (1∣alt∣Cmax) and tardiness time (1∣alt∣Tmax). We devise a dynamic programming algorithm and analyze the complexity of problem. To the best of our knowledge, we are the first to use dynamic programming to minimize Cmax and Tmax without preemptions under alternate period.

[1]  John E. Beasley,et al.  A dynamic programming based algorithm for the crew scheduling problem , 1998, Comput. Oper. Res..

[2]  Chengbin Chu,et al.  Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times , 2009, Eur. J. Oper. Res..

[3]  I. Kacem,et al.  Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint , 2008 .

[4]  Nidhal Rezg,et al.  Production planning in integrated maintenance context for multi-period multi-product failure-prone single-machine , 2013, 2013 IEEE 18th Conference on Emerging Technologies & Factory Automation (ETFA).

[5]  Guoqing Wang,et al.  Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times , 2005, Ann. Oper. Res..

[6]  Laurence A. Wolsey,et al.  A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..

[7]  Chung-Lun Li,et al.  Multitasking via alternate and shared processing: Algorithms and complexity , 2016, Discret. Appl. Math..

[8]  John Sum,et al.  Scheduling jobs with multitasking and asymmetric switching costs , 2017, 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[9]  Feifeng Zheng,et al.  Multitasking scheduling problems with a rate-modifying activity , 2017, Int. J. Prod. Res..

[10]  Martin Feldmann,et al.  Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches , 2003 .

[11]  François Marmier,et al.  Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints , 2012, Comput. Oper. Res..

[12]  Chengbin Chu,et al.  A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..

[13]  Feifeng Zheng,et al.  Algorithms for the joint multitasking scheduling and common due date assignment problem , 2017, Int. J. Prod. Res..

[14]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[15]  T. C. Edwin Cheng,et al.  Single-machine scheduling with time-dependent and position-dependent deteriorating jobs , 2015, Int. J. Comput. Integr. Manuf..

[16]  E. L. Lawler,et al.  A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1991 .

[17]  George Steiner,et al.  A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems , 1990 .

[18]  Xiwen Lu,et al.  Approximation algorithms for the single-machine scheduling with a period of maintenance , 2016, Optim. Lett..

[19]  Han Hoogeveen,et al.  Optimal On-Line Algorithms for Single-Machine Scheduling , 1996, IPCO.

[20]  D. Yang,et al.  Single machine total completion time scheduling problem with workload-dependent maintenance duration , 2015 .

[21]  Chengbin Chu,et al.  Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times , 2008, Comput. Oper. Res..