ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling
- 1 November 1998
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 44 (11-part-1), 1548-1561
- https://doi.org/10.1287/mnsc.44.11.1548
Abstract
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.Keywords
This publication has 22 references indexed in Scilit:
- Capacity planning and lead time managementInternational Journal of Production Economics, 1996
- A general approximation for the single product lot sizing model with queueing delaysEuropean Journal of Operational Research, 1996
- Extending the shifting bottleneck procedure to real-life applicationsEuropean Journal of Operational Research, 1996
- A lot sizing model with queueing delays: The issue of safety timeEuropean Journal of Operational Research, 1996
- Solving the job shop scheduling problem with tabu searchIIE Transactions, 1995
- A modified shifting bottleneck procedure for job-shop schedulingInternational Journal of Production Research, 1993
- Approximations for the time spent in a dynamic job shop with applications to due-date assignmentInternational Journal of Production Research, 1988
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- Open queueing network models of dynamic job shopsInternational Journal of Production Research, 1981
- On the approximations to the single server queueInternational Journal of Production Research, 1980