Algorithms for a two-machine flowshop problem with jobs of two classes

[1]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

[2]  T. C. Edwin Cheng,et al.  Two-agent scheduling in a flowshop , 2016, Eur. J. Oper. Res..

[3]  Wen-Chiung Lee,et al.  Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem , 2010, Expert Syst. Appl..

[4]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[5]  Gur Mosheiov,et al.  Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents , 2014, J. Oper. Res. Soc..

[6]  Alessandro Agnetis,et al.  Scheduling Problems with Two Competing Agents , 2004, Oper. Res..

[7]  T. C. Edwin Cheng,et al.  Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs , 2017, J. Sched..

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

[9]  Jinjiang Yuan,et al.  Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost , 2016, Appl. Math. Comput..

[10]  Jacques Teghem,et al.  Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints , 2013, Int. Trans. Oper. Res..

[11]  Yeong-Dae Kim,et al.  Minimizing total tardiness on a two-machine re-entrant flowshop , 2009, Eur. J. Oper. Res..

[12]  Wei-Chang Yeh,et al.  A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime , 2004 .

[13]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[14]  Deming Lei,et al.  Multi-objective production scheduling: a survey , 2009 .

[15]  Yeong-Dae Kim,et al.  Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times , 2014, Comput. Oper. Res..

[16]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[17]  Wen-Chiung Lee,et al.  A two-machine flowshop problem with two agents , 2011, Comput. Oper. Res..

[18]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[19]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[20]  Jeffrey E. Schaller,et al.  Note on minimizing total tardiness in a two-machine flowshop , 2005, Comput. Oper. Res..

[21]  Chin-Chia Wu,et al.  A bi-criteria two-machine flowshop scheduling problem with a learning effect , 2006, J. Oper. Res. Soc..

[22]  Tariq Aldowaisan,et al.  No-wait flowshops with bicriteria of makespan and total completion time , 2002, J. Oper. Res. Soc..

[23]  Yu-Hsiang Chung,et al.  A single-machine bi-criterion scheduling problem with two agents , 2013, Appl. Math. Comput..

[24]  Mehmet Mutlu Yenisey,et al.  Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends , 2014 .

[25]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[26]  Jatinder N. D. Gupta,et al.  Two-machine flowshop scheduling to minimize the number of tardy jobs , 1997 .