The "Orchard" scheduler for manufacturing systems

Abstract This paper describes Orchard, which is a heuristic algorithm for scheduling the loading of jobs into a manufacturing system. While Orchard was specifically designed for use at a particular printed circuit board line, it is sufficiently generic to be used at other manufacturing systems as well. In general, such a manufacturing system performs several operations on each job with multiple machines performing each operation. The routing of each job may involve stochastic branching including rework loops, and there may be a need to assign human operators to operations. The Orchard heuristic can be adapted to two different objective functions: weighted mean flow time, and an objective specially formulated for the circuit board line. The present paper describes all aspects of Orchard except its operator assignment module (which is described in another paper) and concludes with results of tests of the algorithm as applied to the circuit board line.

[1]  Stanley Gershwin,et al.  An algorithm for the computer control of production in a flexible manufacturing system , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[2]  Robert J. Wittrock.  Operator assignment and the parametric preflow algorithm , 1992 .

[3]  Sunder Kekre,et al.  SCHED-STAR A PRICE-BASED SHOP SCHEDULING MODULE , 1988 .

[4]  James C. Bean,et al.  Match-up real-time scheduling , 1985 .

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

[6]  Lawrence M. Wein,et al.  Optimal Control of a Two-Station Brownian Network , 2015, Math. Oper. Res..

[7]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[8]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

[9]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Network with Controllable Inputs , 2011, Oper. Res..

[10]  Stanley B. Gershwin,et al.  An algorithm for the computer control of a flexible manufacturing system , 1983 .

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

[12]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[13]  B. Berman,et al.  Atlas of photoneutron cross sections obtained with monoenergetic photons. Final edition, 1986 , 1986 .

[14]  Stanley B. Gershwin,et al.  Short term production scheduling of an automated manufacturing facility , 1984, The 23rd IEEE Conference on Decision and Control.