Due-window assignment scheduling in the proportionate flow shop setting

In this paper, we consider due-window assignment scheduling in the proportionate flow shop setting with position-dependent weights where the weights depend on the position in which a job is scheduled. Under the common due-window (CONW) and slack due-window (SLKW) assignment methods, the location of the window and its properties are established. The objective is to determine the sequence of all jobs to minimize the total weighted cost function where the total weighted cost function must also consider the window start time and size. Based on these considerations, the corresponding algorithm and algorithm complexity are proposed.

[1]  Adam Janiak,et al.  A survey on scheduling problems with due windows , 2015, Eur. J. Oper. Res..

[2]  Said Aqil,et al.  On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time , 2019, Ann. Oper. Res..

[3]  T.C.E. Cheng,et al.  Two-machine flowshop scheduling with a truncated learning function to minimize the makespan , 2013 .

[4]  Shanlin Yang,et al.  Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan , 2015, Eur. J. Oper. Res..

[5]  Gur Mosheiov,et al.  A due-window assignment problem with position-dependent processing times , 2008, J. Oper. Res. Soc..

[6]  Javier Puente,et al.  Solving multi-objective rescheduling problems in dynamic permutation flow shop environments with disruptions , 2018, Int. J. Prod. Res..

[7]  Surya D. Liman,et al.  A single machine scheduling problem with common due window and controllable processing times , 1997, Ann. Oper. Res..

[8]  Jun Wang,et al.  Research on permutation flow shop scheduling problems with general position-dependent learning effects , 2013, Ann. Oper. Res..

[9]  Ji-Bo Wang,et al.  Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect , 2018, Engineering Optimization.

[10]  Ji-Bo Wang,et al.  Minimizing makespan in three-machine flow shops with deteriorating jobs , 2013, Comput. Oper. Res..

[11]  T. C. Edwin Cheng,et al.  Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty , 2001, Ann. Oper. Res..

[12]  Chen-Yang Cheng,et al.  Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities , 2018, Comput. Ind. Eng..

[13]  Gur Mosheiov,et al.  Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance , 2016, Eur. J. Oper. Res..

[14]  Gur Mosheiov,et al.  Minmax due-date assignment with a time window for acceptable lead-times , 2013, Ann. Oper. Res..

[15]  Bo Zhang,et al.  Due-window assignment scheduling problems with position-dependent weights on a single machine , 2020 .

[16]  Gur Mosheiov,et al.  Minimizing the number of early jobs on a proportionate flowshop , 2015, J. Oper. Res. Soc..

[17]  Mourad Boudhar,et al.  Flow shop scheduling problem with conflict graphs , 2018, Ann. Oper. Res..

[18]  Xinyu Sun,et al.  Single-machine scheduling with deteriorating effects and machine maintenance , 2019 .

[19]  T. C. Edwin Cheng,et al.  Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time , 2014, J. Oper. Res. Soc..

[20]  Christos Koulamas,et al.  Review of the ordered and proportionate flow shop scheduling research , 2013 .

[21]  Na Li,et al.  Flow shop scheduling with jobs arriving at different times , 2018, International Journal of Production Economics.

[22]  Ji-Bo Wang,et al.  Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times , 2014, Asia Pac. J. Oper. Res..

[23]  T.C.E. Cheng,et al.  Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity , 2012 .

[24]  Erhan Kozan,et al.  Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs , 2013, Inf. Sci..

[25]  Michael Pinedo,et al.  Scheduling in manufacturing systems: new trends and perspectives , 2018, Int. J. Prod. Res..

[26]  Panos M. Pardalos,et al.  A hybrid VNS-HS algorithm for a supply chain scheduling problem with deteriorating jobs , 2018, Int. J. Prod. Res..

[27]  Christos Koulamas,et al.  On equivalence between the proportionate flow shop and single‐machine scheduling problems , 2015 .

[28]  Dujuan Wang,et al.  Bicriterion scheduling with a negotiable common due window and resource-dependent processing times , 2019, Inf. Sci..

[29]  T.C.E. Cheng,et al.  A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times , 2017 .

[30]  Ji-Bo Wang,et al.  Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects , 2011, Ann. Oper. Res..

[31]  Ji-Bo Wang,et al.  Proportionate flowshop scheduling with position-dependent weights , 2020, Engineering Optimization.