Literature Review of Open Shop Scheduling Problems

This paper discusses review of literature of open shop scheduling problems. First, the problem is classified as per different measures of performance, viz., minimization of makespan, minimization of sum of completion times of jobs, minimization of sum of weighted completion times of all jobs, minimization of total tardiness of all jobs, minimization of sum of weighted tardiness of all jobs, minimization of weighted sum of tardy jobs, and miscellaneous measures of the open shop scheduling problem. In each category, the literature is further classified based on approaches used and then the contributions of researchers in the respective categories are presented. Directions for future research are discussed in the end.

[1]  David Alcaide López de Pablo,et al.  Network flow approaches to pre-emptive open-shop scheduling problems with time-windows , 2006, Eur. J. Oper. Res..

[2]  Wieslaw Kubiak,et al.  Preemptive open shop scheduling with multiprocessors: polynomial cases and applications , 2008, J. Sched..

[3]  T. C. Edwin Cheng,et al.  Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem , 2005, Eur. J. Oper. Res..

[4]  Hsing-Hung Lin,et al.  A new particle swarm optimization for multi-objective open shop scheduling , 2011 .

[5]  Seyed Hossein,et al.  A Mixed Integer Linear Formulation for the Open Shop Earliness-Tardiness Scheduling Problem , 2010 .

[6]  S. Louis,et al.  Genetic Algorithms for Open Shop Scheduling and Re-scheduling , 1996 .

[7]  Krzysztof Giaro,et al.  Compact Scheduling In Open Shop With Zero-One Time Operations , 1999 .

[8]  Iraj Mahdavi,et al.  A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates , 2012, Appl. Soft Comput..

[9]  Frank Werner,et al.  Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop , 2008, Math. Comput. Model..

[10]  S. F. Fatemi Ghomi,et al.  A study on open shop scheduling to minimise total tardiness , 2011 .

[11]  Ching-Fang Liaw,et al.  A tabu search algorithm for the open shop scheduling problem , 1999, Comput. Oper. Res..

[12]  T. C. Edwin Cheng,et al.  Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs , 2003, J. Sched..

[13]  Alexander V. Kononov,et al.  When difference in machine loads leadsto efficient scheduling in open shops , 1999, Ann. Oper. Res..

[14]  Alexander V. Kononov,et al.  Efficient approximation algorithms for the routing open shop problem , 2013, Comput. Oper. Res..

[15]  Hiroaki Ishii,et al.  Two Machine open Shop Scheduling Problem with Bi-criteria , 1994, Discret. Appl. Math..

[16]  Chun-Yuan Cheng,et al.  The total completion time open shop scheduling problem with a given sequence of jobs on one machine , 2002, Comput. Oper. Res..

[17]  Sami Khuri,et al.  Genetic Algorithms for Solving Open Shop Scheduling Problems , 1999, EPIA.

[18]  Han Hoogeveen,et al.  The two-machine open shop problem: To fit or not to fit, that is the question , 2003, Oper. Res. Lett..

[19]  Chia-Shin Chung,et al.  Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival , 1988 .

[20]  J. Billaut,et al.  A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint , 2002, J. Oper. Res. Soc..

[21]  Thomas Tautenhahn,et al.  On the set of solutions of the open shop problem , 1999, Ann. Oper. Res..

[22]  Sartaj Sahni,et al.  Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops , 1981, Oper. Res..

[23]  Reza Tavakkoli-Moghaddam,et al.  Solving a multi-objective open shop scheduling problem by a novel hybrid ant colony optimization , 2011, Expert Syst. Appl..

[24]  Narendra Jussien,et al.  Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems , 1998, Eur. J. Oper. Res..

[25]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[26]  Vitaly A. Strusevich,et al.  Approximation Algorithms for Three-Machine Open Shop Scheduling , 1993, INFORMS J. Comput..

[27]  T. C. Edwin Cheng,et al.  Two-machine open shop problem with controllable processing times , 2007, Discret. Optim..

[28]  Maxim Sviridenko,et al.  A linear time approximation scheme for makespan minimization in an open shop with release dates , 2002, Oper. Res. Lett..

[29]  R. L. Bulfin,et al.  Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates , 1988, Oper. Res..

[30]  Christelle Guéret,et al.  A new lower bound for the open‐shop problem , 1999, Ann. Oper. Res..

[31]  Ching-Fang Liaw,et al.  An efficient tabu search approach for the two-machine preemptive open shop scheduling problem , 2003, Comput. Oper. Res..

[32]  Jacek Blazewicz,et al.  Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource , 1992, Discret. Appl. Math..

[33]  Marek Kubale,et al.  Complexity results on open shop scheduling to minimize total cost of operations , 2002, Int. J. Comput. Syst. Signals.

[34]  Djamal Rebaïne.  SCHEDULING THE TWO-MACHINE OPEN SHOP PROBLEM WITH NON-SYMMETRIC TIME DELAYS , 2004 .

[35]  Francis Y. L. Chin,et al.  Scheduling the Open Shop to Minimize Mean Flow Time , 1982, SIAM J. Comput..

[36]  WerraDominique,et al.  Preemptive open shop scheduling with multiprocessors , 2008 .

[37]  O Seraj,et al.  A Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach (RESEARCH NOTE) , 2009 .

[38]  Malgorzata Sterna,et al.  Open shop scheduling problems with late work criteria , 2004, Discret. Appl. Math..

[39]  T. C. Edwin Cheng,et al.  Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays , 2004, Ann. Oper. Res..

[40]  D Rebaine,et al.  Two-machine open shop scheduling with special transportation times , 1999, J. Oper. Res. Soc..

[41]  Maxim Sviridenko,et al.  A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective , 2002, J. Algorithms.

[42]  Christos D. Tarantilis,et al.  SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM , 2009, Cybern. Syst..

[43]  Christian Prins,et al.  Competitive genetic algorithms for the open-shop scheduling problem , 2000, Math. Methods Oper. Res..

[44]  Vitaly A. Strusevich,et al.  Planning Machine Maintenance in Two-Machine Shop Scheduling , 2006, Oper. Res..

[45]  Lixin Tang,et al.  A new heuristic for open shop total completion time problem , 2010 .

[46]  Hung-Tso Lin,et al.  Heuristics for scheduling in a no-wait open shop with movable dedicated machines , 2008 .

[47]  Thomas Tautenhahn.  Scheduling Unit-Time Open Shops with Deadlines , 1994, Oper. Res..

[48]  Anurag Agarwal,et al.  Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem , 2005 .

[49]  Mostafa Zandieh,et al.  Scheduling open shops with parallel machines to minimize total completion time , 2011, J. Comput. Appl. Math..

[50]  Zhaohui Liu,et al.  Routing open shop and flow shop scheduling problems , 2011, Eur. J. Oper. Res..

[51]  Jesus J. Aguirre-Solis.  Tabu Search Algorithm For the Open Shop Scheduling Problem With Sequence Dependent Setup Times , 2003 .

[52]  Gerhard J. Woeginger,et al.  Approximation algorithms for the multiprocessor open shop scheduling problem , 1999, Oper. Res. Lett..

[53]  Frank Werner,et al.  Heuristic constructive algorithms for open shop scheduling to minimize mean flow time , 2008, Eur. J. Oper. Res..

[54]  Mostafa Zandieh,et al.  A contribution and new heuristics for open shop scheduling , 2010, Comput. Oper. Res..

[55]  Moshe Dror,et al.  Openshop Scheduling with Machine Dependent Processing Times , 1992, Discret. Appl. Math..

[56]  H. Bräsel,et al.  A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints , 1995, Discret. Appl. Math..

[57]  Steef L. van de Velde,et al.  On-line two-machine open shop scheduling with time lags , 2010, Eur. J. Oper. Res..

[58]  Steef L. van de Velde,et al.  On-line two-machine job shop scheduling with time lags , 2010, Inf. Process. Lett..

[60]  D. de Werra,et al.  Scheduling periodic jobs compacly within a fixed time period in open shops , 1994 .

[61]  Chelliah Sriskandarajah,et al.  Open shops with jobs overlap - revisited , 2005, Eur. J. Oper. Res..

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

[63]  Vitaly A. Strusevich,et al.  A polynomial algorithm for the three‐machineopen shop with a bottleneck machine , 1999, Ann. Oper. Res..

[64]  Joaquín Sicilia,et al.  A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures , 2005 .

[65]  Ghandehari Mahsa,et al.  GENERALIZED CYCLIC OPEN SHOP SCHEDULING AND A HYBRID ALGORITHM , 2008 .

[66]  D. Sha,et al.  A Modified Particle Swarm Optimization for Multi-objective Open Shop Scheduling , 2022 .

[67]  H. L. Ong,et al.  Metaheuristics for the Mixed shop Scheduling Problem , 2004, Asia Pac. J. Oper. Res..

[68]  Peter Brucker,et al.  A Branch & Bound Algorithm for the Open-shop Problem , 1997, Discret. Appl. Math..

[69]  Ching-Fang Liaw,et al.  An iterative improvement approach for the nonpreemptive open shop scheduling problem , 1998, Eur. J. Oper. Res..

[70]  P. Shahabudeen,et al.  GA based heuristic for the open job shop scheduling problem , 2006 .

[71]  R. Tavakkoli-Moghaddam,et al.  RESEARCH NOTE A TABU SEARCH METHOD FOR A NEW BI-OBJECTIVE OPEN SHOP SCHEDULING PROBLEM BY A FUZZY MULTI- OBJECTIVE DECISION MAKING APPROACH , 2009 .

[72]  M Modares,et al.  APPLYING CIRCULAR COLORING TO OPEN SHOP SCHEDULING , 2008 .

[73]  Rajiv Gandhi,et al.  Improved results for data migration and open shop scheduling , 2004, TALG.

[74]  Thomas A. Roemer,et al.  A note on the complexity of the concurrent open shop problem , 2006, J. Sched..

[75]  Christos Koulamas,et al.  Open Shop Scheduling with Maximal Machines , 1997, Discret. Appl. Math..

[76]  Deepak Gupta,et al.  OPTIMAL TWO STAGE OPEN SHOP SCHEDULING, PROCESSING TIME ASSOCIATED WITH PROBABILITIES INCLUDING TRANSPORTATION TIME AND JOB BLOCK CRITERIA , 2012 .

[77]  Lixin Tang,et al.  Open shop scheduling problem to minimize makespan with release dates , 2013 .

[78]  Gerhard J. Woeginger,et al.  Linear time approximation scheme for the multiprocessor open shop problem , 2001, Discret. Appl. Math..

[79]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[80]  S. Thamarai Selvi,et al.  Identification of a rank minimal optimal sequence for Open Shop scheduling problems , 2003 .

[81]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[82]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

[83]  Wieslaw Kubiak,et al.  Two-Machine Open Shops with Renewable Resources , 1997, Oper. Res..

[84]  Marek Kubale.  Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals , 1997, Discret. Appl. Math..

[85]  Peter Ross,et al.  A Promising Hybrid GA/Heuristic Approach for Open-Shop Scheduling Problems , 1994, ECAI.

[86]  Zbigniew Kokosiński,et al.  Hybrid genetic algorithms for the open-shop scheduling problem , 2007 .

[87]  Christos Koulamas,et al.  Open shop scheduling with makespan and total completion time criteria , 2000, Comput. Oper. Res..

[88]  Marie E. Matta.  A genetic algorithm for the proportionate multiprocessor open shop , 2009, Comput. Oper. Res..

[89]  Vitaly A. Strusevich,et al.  Non-preemptive two-machine open shop scheduling with non-availability constraints , 2003, Math. Methods Oper. Res..

[90]  Yueh-Min Huang,et al.  A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems , 2011, Expert Syst. Appl..

[91]  Lu Lu,et al.  An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity , 1993, Math. Oper. Res..

[92]  Fuh-Der Chou,et al.  Minimizing makespan in a two-stage system with flowshop and open shop , 2005, Comput. Ind. Eng..

[93]  Mostafa Zandieh,et al.  Integrating non-preemptive open shops scheduling with sequence-dependent setup times using advanced metaheuristics , 2010, Expert Syst. Appl..

[94]  Adam Nadolski,et al.  Chromatic scheduling in a cyclic open shop , 2005, Eur. J. Oper. Res..

[95]  Frank Werner,et al.  Using Simulated Annealing for Open Shop Scheduling with Sum Criteria , 2008 .

[96]  Hiroaki Ishii,et al.  An open shop scheduling problem with fuzzy allowable time and fuzzy resource constraint , 2000, Fuzzy Sets Syst..

[97]  Vitaly A. Strusevich,et al.  Two-machine open shop scheduling with an availability constraint , 2001, Oper. Res. Lett..

[98]  André Langevin,et al.  An Optimal Constraint Programming Approach to the Open-Shop Problem , 2012, INFORMS J. Comput..

[99]  Jacek Blazewicz,et al.  Some Preemptive open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource. (Discrete Applied Mathematics 35 (1992) 205-219) , 1993, Discret. Appl. Math..

[100]  Jatinder N. D. Gupta,et al.  Two‐machine open shop scheduling with secondary criteria , 2003 .

[101]  Wieslaw Kubiak,et al.  A projective algorithm for preemptive open shop scheduling with two multiprocessor groups , 2010, Oper. Res. Lett..

[102]  Gur Mosheiov,et al.  Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps , 1998, Oper. Res. Lett..

[103]  Alain Hertz,et al.  Feasible edge colorings of trees with cardinality constraints , 2000, Discret. Math..