Proportionate flowshop scheduling with position-dependent weights

ABSTRACT This article addresses proportionate flowshop scheduling problems with position-dependent weights wherein the weight is not related to the job but to the position in which the job is scheduled. Common and slack due date assignment models are discussed under a due date assignment framework. The goal is to determine a feasible schedule for all jobs and due dates of all jobs to minimize a total cost function wherein the objective function is of the minsum type. Optimal properties for the problems are proposed, based on which polynomial time algorithms are provided to solve these two problems optimally.

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

[2]  T.C.E. Cheng,et al.  Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times , 2013 .

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

[4]  Christos Koulamas,et al.  Proportionate flow shop: New complexity results and models with due date assignment , 2015 .

[5]  Gang Li,et al.  Optimal due-date assignment problem with learning effect and resource-dependent processing times , 2014, Optim. Lett..

[6]  Jian-Jun Wang,et al.  Single-machine due date assignment problem with deteriorating jobs and resource-dependent processing times , 2013 .

[7]  T.C.E. Cheng,et al.  CON/SLK due date assignment and scheduling on a single machine with two agents , 2016 .

[8]  Xi Zhang,et al.  Several flow shop scheduling problems with truncated position-based learning effect , 2013, Comput. Oper. Res..

[9]  Lu Liu,et al.  Single Machine CON/SLK Due Date Assignment Scheduling with Controllable Processing Time and Job-dependent Learning Effects , 2018, Comput. J..

[10]  Han Hoogeveen,et al.  Minimizing total weighted completion time in a proportionate flow shop , 1998 .

[11]  Ji-Bo Wang,et al.  Permutation flowshop scheduling with simple linear deterioration , 2018, Engineering Optimization.

[12]  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.

[13]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[14]  Alexandre Dolgui,et al.  Scheduling with due date assignment under special conditions on job processing , 2012, J. Sched..

[15]  Jun Wang,et al.  Some results of the worst-case analysis for flow shop scheduling with a learning effect , 2013, Ann. Oper. Res..

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

[17]  Tangbin Xia,et al.  Joint optimization of preventive maintenance and flexible flowshop sequence-dependent group scheduling considering multiple setups , 2018, Engineering Optimization.

[18]  Chin-Chia Wu,et al.  Single-machine scheduling and common due date assignment with potential machine disruption , 2018, Int. J. Prod. Res..

[19]  Yu-Hsiang Chung,et al.  A parallel-machine scheduling problem with two competing agents , 2017 .

[20]  Jun Wang,et al.  Due date assignment and convex resource allocation scheduling with variable job processing times , 2016 .

[21]  Chengbin Chu,et al.  A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..

[22]  T.C.E. Cheng,et al.  Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity , 2014 .

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

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

[25]  T. C. Edwin Cheng,et al.  Bi-criterion single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times , 2016, J. Oper. Res. Soc..

[26]  Herbert Hamers,et al.  Proportionate flow shop games , 2006, J. Sched..

[27]  Xiangpei Hu,et al.  Single machine scheduling with slack due dates assignment , 2017 .

[28]  Marcelo Seido Nagano,et al.  High-performing heuristics to minimize flowtime in no-idle permutation flowshop , 2019 .

[29]  Chengbin Chu,et al.  Due date assignment and scheduling: Slk, TWK and other due date assignment models , 2002 .