Scheduling with Limited Processor Availability

In scheduling theory the basic model assumes that all machines are continuously available for processing throughout the planning horizon.

[1]  Joyce Friedman,et al.  A Non-Numerical Approach to Production Scheduling Problems , 1955, Oper. Res..

[2]  Chung-Yee Lee,et al.  Machine Scheduling with Availability Constraints , 2004, Handbook of Scheduling.

[3]  Zhen Liu,et al.  Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates , 1995, Discret. Appl. Math..

[4]  T. C. Edwin Cheng,et al.  An improved heuristic for two-machine flowshop scheduling with an availability constraint , 2000, Oper. Res. Lett..

[5]  Oliver Braun,et al.  Stability of Johnson's schedule with respect to limited machine availability , 2002 .

[6]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[7]  Zhen Liu,et al.  Stochastic Scheduling with Variable Profile and Precedence Constraints , 1997, SIAM J. Comput..

[8]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[9]  Xiangtong Qi,et al.  Scheduling the maintenance on a single machine , 1999, J. Oper. Res. Soc..

[10]  Eric Sanlaville,et al.  Machine scheduling with availability constraints , 1998, Acta Informatica.

[11]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[12]  Chung-Yee Lee,et al.  Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint , 1997, Oper. Res. Lett..

[13]  Wieslaw Kubiak,et al.  Parallel Branch and Bound Algorithms for the Two-machine Flow Shop Problem with Limited Machine Availability , 2000 .

[14]  Danny Dolev,et al.  Scheduling Flat Graphs , 1985, SIAM J. Comput..

[15]  Vitaly A. Strusevich,et al.  Two‐machine flow shop no‐wait scheduling with a nonavailability interval , 2004 .

[16]  Zhi-Long Chen,et al.  Scheduling jobs and maintenance activities on parallel machines , 2000 .

[17]  E. L. Lawler,et al.  Preemptive Scheduling of. Precedence-Constrained Jobs on Parallel Machines , 1981 .

[18]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

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

[20]  H. Kellerer.  Algorithms for multiprocessor scheduling with machine release times , 1998 .

[21]  Michel Gourgand,et al.  A review of the static stochastic flow-shop scheduling problem , 2000, J. Decis. Syst..

[22]  Chung Yee Lee,et al.  Scheduling maintenance and semiresumable jobs on a single machine , 1999 .

[23]  Riad Aggoune,et al.  Two-Job Shop Scheduling Problems with Availability Constraints , 2004, ICAPS.

[24]  Soo Y. Chang,et al.  The Worst-case Analysis of the MULTIFIT Algorithm for Scheduling Nonsimultaneous Parallel Machines , 1999, Discret. Appl. Math..

[25]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[26]  Lixin Shen,et al.  Parallel-machine scheduling with non-simultaneous machine available time , 2013 .

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

[28]  Eric Sanlaville,et al.  Nearly on Line Scheduling of Preemptive Independent Tasks , 1995, Discret. Appl. Math..

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

[30]  Riad Aggoune,et al.  Minimizing the makespan for the flow shop scheduling problem with availability constraints , 2001, Eur. J. Oper. Res..

[31]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[32]  Marie-Laure Espinouse,et al.  Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability , 2001, J. Oper. Res. Soc..

[33]  Alexander H. G. Rinnooy Kan,et al.  Single machine flow-time scheduling with a single breakdown , 1989, Acta Informatica.

[34]  Gur Mosheiov,et al.  Minimizing the sum of job completion times on capacitated parallel machines , 1994 .

[35]  J. Carlier.  The one-machine sequencing problem , 1982 .

[36]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[37]  Chien-Hung Lin,et al.  Makespan minimization for two parallel machines with an availability constraint , 2005, Eur. J. Oper. Res..

[38]  Marie-Laure Espinouse,et al.  Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability , 1999 .

[39]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[40]  Wieslaw Kubiak,et al.  Two-machine flow shops with limited machine availability , 2002, Eur. J. Oper. Res..

[41]  T. C. Edwin Cheng,et al.  3/2-approximation for Two-machine No-wait Flowshop Scheduling with Availability Constraints , 2003, Inf. Process. Lett..

[42]  Oliver Braun,et al.  Optimality of Jackson's permutations with respect to limited machine availability , 2006, Int. Trans. Oper. Res..

[43]  Günter Schmidt,et al.  Scheduling Independent Tasks with Deadlines on Semi-identical Processors , 1988 .

[44]  Susanne Albers,et al.  Scheduling with unexpected machine breakdowns , 2001, Discret. Appl. Math..

[45]  Sartaj Sahni,et al.  Dual criteria preemptive open‐shop problems with minimum makespan , 1995 .

[46]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[47]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[48]  Chung-Yee Lee.  Two-machine flowshop scheduling with availability constraints , 1999, Eur. J. Oper. Res..

[49]  Wieslaw Kubiak,et al.  Heuristic algorithms for the two-machine flowshop with limited machine availability ☆ , 2001 .

[50]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[51]  Joachim Breit,et al.  An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint , 2004, Inf. Process. Lett..

[52]  Charles U. Martel,et al.  Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs , 1989, Oper. Res..

[53]  C. T. Ng,et al.  An FPTAS for scheduling a two‐machine flowshop with one unavailability interval , 2004 .

[54]  Marie-Claude Portmann,et al.  Flow shop scheduling problem with limited machine availability: A heuristic approach , 2003 .

[55]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

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

[57]  Chung-Yee Lee,et al.  Single machine flow-time scheduling with scheduled maintenance , 1992, Acta Informatica.

[58]  Manfred K. Warmuth,et al.  Profile Scheduling of Opposing Forests and Level Orders , 1985 .

[59]  Wieslaw Kubiak,et al.  Scheduling preemptable tasks on parallel processors with limited availability , 2000, Parallel Comput..

[60]  Günter Schmidt,et al.  Scheduling on semi-identical processors , 1984, Z. Oper. Research.

[61]  T. C. Edwin Cheng,et al.  Two-Machine Flowshop Scheduling with Consecutive Availability Constraints , 1999, Inf. Process. Lett..

[62]  Edward G. Coffman,et al.  Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems , 1970, JACM.

[63]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[64]  Joachim Breit,et al.  A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint , 2006, Comput. Oper. Res..

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

[66]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[67]  Jacek Blazewicz,et al.  An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints , 2005, Eur. J. Oper. Res..

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

[69]  Chung-Yee Lee,et al.  Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times , 1993, Discret. Appl. Math..

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

[71]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[72]  Eugene L. Lawler,et al.  Preemptive scheduling of uniform machines subject to release dates : (preprint) , 1979 .

[73]  Li Guohui,et al.  Exact bounds of the modified lpt algorithms applying to parallel machines scheduling with nonsimultaneous machine available times , 1997 .

[74]  C.-Y. Lee,et al.  Machine scheduling with a rate-modifying activity , 2001, Eur. J. Oper. Res..

[75]  Jacek Blazewicz,et al.  Scheduling multiprocessor tasks on parallel processors with limited availability , 2003, Eur. J. Oper. Res..

[76]  Jacek Blazewicz,et al.  Scheduling jobs in open shops with limited machine availability , 2002, RAIRO Oper. Res..

[77]  T. C. Edwin Cheng,et al.  Approximability of two-machine no-wait flowshop scheduling with availability constraints , 2003, Oper. Res. Lett..

[78]  Chung-Yee Lee,et al.  Parallel machines scheduling with nonsimultaneous machine available time , 1991, Discret. Appl. Math..