A note on scheduling a rate modifying activity to minimize total late work

Abstract We study a single machine scheduling problem with a rate modifying activity. In most cases, performing such an activity (e.g., a maintenance procedure) improves the system performance, as reflected by shorter processing times of the jobs processed after it. The scheduling measure assumed is total late work: each job is considered as a collection of unit-time jobs, and the late work is defined as the number of tardy units. The problem is NP-hard, and we introduce and test numerically a pseudo-polynomial dynamic programming algorithm. Our results indicate that the algorithm solves large problem instances efficiently.

[1]  Byung Soo Kim,et al.  A hybrid genetic algorithm with two-stage dispatching heuristic for a machine scheduling problem with step-deteriorating jobs and rate-modifying activities , 2016, Comput. Ind. Eng..

[2]  Gur Mosheiov,et al.  A single machine scheduling problem to minimize total early work , 2016, Comput. Oper. Res..

[3]  Valery S. Gordon,et al.  A note: Common due date assignment for a single machine scheduling with the rate-modifying activity , 2009, Comput. Oper. Res..

[4]  Malgorzata Sterna,et al.  Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy , 2004, AACC.

[5]  Gur Mosheiov,et al.  New Results On Sequencing With Rate Modification , 2003 .

[6]  Byung Soo Kim,et al.  Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities , 2018, Comput. Oper. Res..

[7]  Vitaly A. Strusevich,et al.  Scheduling with Time-Changing Effects and Rate-Modifying Activities , 2017 .

[8]  T. C. Edwin Cheng,et al.  Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity , 2013, Comput. Ind. Eng..

[9]  T. C. Edwin Cheng,et al.  Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost , 2012, Comput. Ind. Eng..

[10]  Malgorzata Sterna,et al.  The two-machine flow-shop problem with weighted late work criterion and common due date , 2005, Eur. J. Oper. Res..

[11]  Chuanli Zhao,et al.  A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity , 2012, Comput. Oper. Res..

[12]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

[13]  Jacek Blazewicz,et al.  Scheduling preemptible tasks on parallel processors with information loss , 1984 .

[14]  Bahram Alidaee,et al.  Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms , 2002 .

[15]  Gur Mosheiov,et al.  Scheduling on a proportionate flowshop to minimise total late work , 2019, Int. J. Prod. Res..

[16]  Malgorzata Sterna,et al.  A comparison of solution procedures for two-machine flow shop scheduling with late work criterion , 2005, Comput. Ind. Eng..

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

[18]  B. M. T. Lin,et al.  Two-machine flow-shop scheduling to minimize total late work , 2006 .

[19]  Malgorzata Sterna,et al.  Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect , 2017, Comput. Ind. Eng..

[20]  Xiao-Yuan Wang,et al.  Single machine common flow allowance scheduling with a rate-modifying activity , 2010, Comput. Ind. Eng..

[21]  C.-Y. Lee,et al.  Machine scheduling with a rate-modifying activity , 2001, Eur. J. Oper. Res..

[22]  Vitaly A. Strusevich,et al.  Single machine scheduling with general positional deterioration and rate-modifying maintenance , 2012 .

[23]  Malgorzata Sterna,et al.  Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date , 2008, Comput. Oper. Res..

[24]  Gur Mosheiov,et al.  Scheduling a deteriorating maintenance activity on a single machine , 2010, J. Oper. Res. Soc..

[25]  Byung Soo Kim,et al.  A rule-based genetic algorithm with an improvement heuristic for unrelated parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities , 2017, Comput. Ind. Eng..

[26]  Bahram Alidaee,et al.  Single machine scheduling to minimize a modified total late work function with multiple due dates , 2014 .

[27]  Malgorzata Sterna,et al.  Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work , 2017, Journal of Optimization Theory and Applications.

[28]  Gur Mosheiov,et al.  Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime , 2014 .

[29]  Chung-Yee Lee,et al.  Single-machine scheduling with maintenance and repair rate-modifying activities , 2001, Eur. J. Oper. Res..

[30]  Malgorzata Sterna,et al.  A survey of scheduling problems with late work criteria , 2011 .

[31]  Malgorzata Sterna,et al.  Late work minimization in flow shops by a genetic algorithm , 2009, Comput. Ind. Eng..

[32]  Daniel Oron,et al.  Due-date assignment and maintenance activity scheduling problem , 2006, Math. Comput. Model..