ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling

We propose a general hierarchical procedure to address real-life job shop scheduling problems. The shop typically produces a variety of products, each with its own arrival stream, its own route through the shop and a given customer due date. The procedure first determines the manufacturing lot sizes for each product. The objective is to minimize the expected lead time, and therefore we model the production environment as a queueing network. Given these lead times, release dates are set dynamically. This in turn creates a time window for every manufacturing order in which the various operations have to be sequenced. The sequencing logic is based on an Extended Shifting Bottleneck Procedure. These three major decisions are next incorporated into a four-phase, hierarchical, operational implementation scheme. A small numerical example is used to illustrate the methodology. The final objective however is to develop a procedure that is useful for large, real-life shops. We therefore report on a real-life application.

• 저널Management Science · 44(11-part-1) · 1548–1561
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.44.11.1548
• 저자Marc Lambrecht, Philip L. Ivens, Nico Vandaele