Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits

[1]  Kangbok Lee,et al.  Ideal schedules in parallel machine settings , 2021, Eur. J. Oper. Res..

[2]  Christos Koulamas,et al.  Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines , 2020, J. Sched..

[3]  Michael Pinedo,et al.  Scheduling , 2018, 2006 15th IEEE International Conference on High Performance Distributed Computing.

[4]  Victor Fernandez-Viagas,et al.  A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation , 2017, Eur. J. Oper. Res..

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

[6]  Byung-Cheon Choi,et al.  Outsourcing and scheduling for two-machine ordered flow shop scheduling problems , 2013, Eur. J. Oper. Res..

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

[8]  Christos Koulamas,et al.  An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines , 2012, Eur. J. Oper. Res..

[9]  Rubén Ruiz,et al.  Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems , 2011, Comput. Oper. Res..

[10]  Rubén Ruiz,et al.  A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem , 2008, INFORMS J. Comput..

[11]  Bertrand M. T. Lin,et al.  Development of new features of ant colony optimization for flowshop scheduling , 2008 .

[12]  B. Lin,et al.  Bicriteria scheduling in a two-machine permutation flowshop , 2006 .

[13]  V. G. Timkovsky,et al.  Ideal preemptive schedules on two processors , 2003, Acta Informatica.

[14]  Chris N. Potts,et al.  A New Heuristic for Three-Machine Flow Shop Scheduling , 1996, Oper. Res..

[15]  Han Hoogeveen,et al.  Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases , 1996, Math. Oper. Res..

[16]  Chandrasekharan Rajendran,et al.  Two-Stage Flowshop Scheduling Problem with Bicriteria , 1992 .

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

[18]  S. S. Panwalkar,et al.  Flowshop sequencing problem with ordered processing time matrices: A general case , 1976 .

[19]  S. S. Panwalkar,et al.  An ordered flow-shop sequencing problem with mean completion time criterion† , 1976 .

[20]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

[22]  Kangbok Lee,et al.  Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time , 2023, Eur. J. Oper. Res..

[23]  Feifeng Zheng,et al.  Online scheduling of ordered flow shops , 2019, Eur. J. Oper. Res..

[24]  Han Hoogeveen,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[25]  R. A. Dudek,et al.  Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .