Shop floor scheduling in discrete parts manufacturing

This paper discusses the architecture and the algorithmic framework of an automatic shop floor planning and scheduling system that is currently used in practice. After reviewing some general trends in manufacturing and the role of planning and scheduling systems in particular, it outlines a decomposition framework which forms the basis of the system proposed here. Next, a number of algorithmic enhancements, needed to deal with more complex but realistic machining systems, are discussed, such as multi-resource scheduling techniques, the inclusion of set-up times in scheduling with due dates, techniques for jobs with assembly structures as well as several minor additional features. A brief exposition of the architecture of the system and a discussion of some experiences in practice conclude the paper.

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

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

[3]  Reha Uzsoy,et al.  Decomposition Methods for Complex Factory Scheduling Problems , 1996 .

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

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

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

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

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

[9]  Eliyahu M. Goldratt,et al.  Computerized shop floor scheduling , 1988 .

[10]  J.M.J. Schutten.  Assembly shop scheduling , 1995 .

[11]  Kevin Mahon,et al.  Deterministic and Stochastic Scheduling , 1983 .

[12]  H. Wiendahl.  Die belastungsorientierte Fertigungssteuerung , 1992 .

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

[14]  Khim Ling Sim,et al.  Time‐based competition , 1999 .

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

[16]  R. Schonberger.  Japanese Manufacturing Techniques , 1982 .

[17]  Jwm Will Bertrand,et al.  Production control and information systems for component-manufacturing shops , 1981 .

[18]  Nancy Lea Hyer,et al.  Group technology in the US manufacturing industry: A survey of current practices , 1989 .

[19]  M. Hammer,et al.  REENGINEERING THE CORPORATION: A MANIFESTO FOR BUSINESS REVOLUTION , 1995 .

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

[21]  Arnoldo C. Hax,et al.  Hierarchical integration of production planning and scheduling , 1973 .

[22]  Wolfgang Bechte.  Theory and practice of load-oriented manufacturing control , 1988 .

[23]  Marc Lambrecht,et al.  Extending the shifting bottleneck procedure to real-life applications , 1996 .

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

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

[26]  Daniel T. Jones,et al.  The machine that changed the world : based on the Massachusetts Institute of Technology 5-million dollar 5-year study on the future of the automobile , 1990 .

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

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

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

[30]  Erik Demeulemeester,et al.  Modelling setup times, process batches and transfer batches using activity network logic , 1996 .

[31]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[32]  W. Deming.  Quality, productivity, and competitive position , 1982 .

[33]  J. M. J. Schutten.  Decomposition methods for complex factory scheduling problems : Irfan M. Ovacik and Reha Uzsoy Kluwer Academic Publishers, Boston/Dordrech/ London, 1997, Dfl 205.00 / $110.00 / £78.25, x + 215 pages , 1998, Eur. J. Oper. Res..

[34]  Johannes Marius Jacobus Schutten,et al.  Shop Floor Scheduling with Setup Times: Efficiency versus Leadtime Performance , 1996 .

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

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