About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
International Journal of Production Economics
Paper
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. © 1992.