Shop Floor Scheduling with Setup Times: Efficiency versus Leadtime Performance

[1]  Mathieu Willem Paul Savelsbergh,et al.  Computer aided routing , 1992 .

[2]  M. Wennink.  Algorithmic support for automated planning boards , 1995 .

[3]  Mwp Martin Savelsbergh,et al.  Behind the screen: DSS from an OR point of view , 1988, Decis. Support Syst..

[4]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[5]  S. Reiter.  A System for Managing Job-Shop Production , 1966 .

[6]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[7]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[8]  Reha Uzsoy,et al.  A shifting bottleneck algorithm for scheduling semiconductor testing operations , 1992 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  P. Brucker,et al.  A branch & bound method for the general-shop problem with sequence dependent setup-times , 1996 .

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

[12]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[13]  Joseph D. Blackburn,et al.  Time-based competition : the next battleground in American manufacturing , 1991 .

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

[15]  Edward R. Tufte,et al.  Envisioning Information , 1990 .

[16]  Bernard W. Taylor,et al.  AN EVALUATION OF SEQUENCING RULES FOR AN ASSEMBLY SHOP , 1985 .

[17]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[18]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

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

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

[21]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[22]  Christopher Vyn Jones,et al.  Visualization and Optimization , 1997 .

[23]  Whm Henk Zijm,et al.  Single-machine scheduling with release dates, due dates and family setup times , 1994 .

[24]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[25]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[26]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[27]  Sartaj Sahni,et al.  Bounds for List Schedules on Uniform Processors , 1980, SIAM J. Comput..

[28]  Salah E. Elmaghraby,et al.  On the Scheduling of Jobs on a Number of Identical Machines. , 1972 .

[29]  E. Balas,et al.  The one-machine problem with delayed precedence constraints and its use in job shop scheduling , 1995 .

[30]  Mihalis Yannakakis,et al.  Optimal Scheduling of Products with Two Subassemblies on a Single Machine , 1989, Oper. Res..

[31]  Henry Laurence Gantt,et al.  Organizing for work , 1919 .

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

[33]  Awi Federgruen,et al.  Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques , 1986 .

[34]  Timothy D. Fry,et al.  The effects of product structure and sequencing rule on assembly shop performance , 1989 .

[35]  John L. Bruno,et al.  Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs , 1978, SIAM J. Comput..

[36]  E. Nowicki,et al.  A block approach for single-machine scheduling with release dates and due dates , 1986 .

[37]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[38]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[39]  Johannes M.J. Schutten,et al.  Parallel machine scheduling with release dates, due dates and family setup times , 1996 .

[40]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[41]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[42]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[43]  J. M. J. Schutten.  Practical job shop scheduling , 1998, Ann. Oper. Res..

[44]  Reha Uzsoy,et al.  Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times , 1993, Oper. Res. Lett..

[45]  William L. Maxwell,et al.  Multiple‐factor rules for sequencing with assembly constraints , 1968 .

[46]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[47]  Geatse Meester,et al.  Multi-resource scheduling of an FMC in discrete parts manufacturing , 1994 .

[48]  Jan Karel Lenstra,et al.  Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

[49]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[50]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[51]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[52]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[53]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[54]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[55]  Stéphane Dauzère-Pérès,et al.  A modified shifting bottleneck procedure for job-shop scheduling , 1993 .

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

[57]  H.J.J. Kals,et al.  A generic architecture for factory activity control , 1996 .

[58]  Jack S. Goodwin,et al.  Evaluating Scheduling Policies in a Multi-Level Assembly System , 1986 .

[59]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[60]  Jacques Carlier,et al.  Scheduling jobs with release dates and tails on identical machines to minimize the makespan , 1987 .