IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v44y1998i11-part-1p1548-1561.html
   My bibliography  Save this article

ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling

Author

Listed:
  • Marc R. Lambrecht

    (Department of Applied Economics, Katholieke Universiteit Leuven, Belgium 3000)

  • Philip L. Ivens

    (Department of Applied Economics, Katholieke Universiteit Leuven, Belgium 3000)

  • Nico J. Vandaele

    (Faculty of Applied Economics, UFSIA, Antwerp, Belgium 2000)

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.

Suggested Citation

  • Marc R. Lambrecht & Philip L. Ivens & Nico J. Vandaele, 1998. "ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling," Management Science, INFORMS, vol. 44(11-Part-1), pages 1548-1561, November.
    • Handle: RePEc:inm:ormnsc:v:44:y:1998:i:11-part-1:p:1548-1561
    DOI: 10.1287/mnsc.44.11.1548
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.44.11.1548
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.44.11.1548?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. David Applegate & William Cook, 1991. "A Computational Study of the Job-Shop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 3(2), pages 149-156, May.
    2. J. A. Buzacott & J. G. Shanthikumar, 1985. "On Approximate Queueing Models of Dynamic Job Shops," Management Science, INFORMS, vol. 31(7), pages 870-887, July.
    3. J. Carlier & E. Pinson, 1989. "An Algorithm for Solving the Job-Shop Problem," Management Science, INFORMS, vol. 35(2), pages 164-176, February.
    4. Ivens, Philip & Lambrecht, Marc, 1996. "Extending the shifting bottleneck procedure to real-life applications," European Journal of Operational Research, Elsevier, vol. 90(2), pages 252-268, April.
    5. Gabriel R. Bitran & Devanath Tirupati, 1988. "Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference," Management Science, INFORMS, vol. 34(1), pages 75-100, January.
    6. Uday S. Karmarkar, 1987. "Lot Sizes, Lead Times and In-Process Inventories," Management Science, INFORMS, vol. 33(3), pages 409-418, March.
    7. Lawrence M. Wein & Philippe B. Chevalier, 1992. "A Broader View of the Job-Shop Scheduling Problem," Management Science, INFORMS, vol. 38(7), pages 1018-1033, July.
    8. Zijm, W. H. M. & Buitenhek, R., 1996. "Capacity planning and lead time management," International Journal of Production Economics, Elsevier, vol. 46(1), pages 165-179, December.
    9. J. M. J. Schutten & S. L. van de Velde & W. H. M. Zijm, 1996. "Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times," Management Science, INFORMS, vol. 42(8), pages 1165-1174, August.
    10. Egon Balas & Jan Karel Lenstra & Alkis Vazacopoulos, 1995. "The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling," Management Science, INFORMS, vol. 41(1), pages 94-109, January.
    11. Lambrecht, Marc R. & Vandaele, Nico J., 1996. "A general approximation for the single product lot sizing model with queueing delays," European Journal of Operational Research, Elsevier, vol. 95(1), pages 73-88, November.
    12. Gabriel R. Bitran & D. Tirupati, 1989. "Approximations for Product Departures from a Single-Server Station with Batch Processing in Multi-Product Queues," Management Science, INFORMS, vol. 35(7), pages 851-878, July.
    13. Lambrecht, Marc R. & Chen, Shaoxiang & Vandaele, Nico J., 1996. "A lot sizing model with queueing delays: The issue of safety time," European Journal of Operational Research, Elsevier, vol. 89(2), pages 269-276, March.
    14. Joseph Adams & Egon Balas & Daniel Zawack, 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling," Management Science, INFORMS, vol. 34(3), pages 391-401, March.
    15. Schutten, J. M. J. & Leussink, R. A. M., 1996. "Parallel machine scheduling with release dates, due dates and family setup times," International Journal of Production Economics, Elsevier, vol. 46(1), pages 119-125, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nico Vandaele & Inneke Van Nieuwenhuyse & Diederik Claerhout & Rony Cremmery, 2008. "Load-Based POLCA: An Integrated Material Control System for Multiproduct, Multimachine Job Shops," Manufacturing & Service Operations Management, INFORMS, vol. 10(2), pages 181-197, September.
    2. Nico J. Vandaele & Marc R. Lambrecht & Nicolas De Schuyter & Rony Cremmery, 2000. "Spicer Off-Highway Products Division-Brugge Improves its Lead-Time and Scheduling Performance," Interfaces, INFORMS, vol. 30(1), pages 83-95, February.
    3. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
    4. Vandaele, Nico & Van Nieuwenhuyse, Inneke & Cupers, Sascha, 2003. "Optimal grouping for a nuclear magnetic resonance scanner by means of an open queueing model," European Journal of Operational Research, Elsevier, vol. 151(1), pages 181-192, November.
    5. Van Nieuwenhuyse, Inneke & Vandaele, Nico & Rajaram, Kumar & Karmarkar, Uday S., 2007. "Buffer sizing in multi-product multi-reactor batch processes: Impact of allocation and campaign sizing policies," European Journal of Operational Research, Elsevier, vol. 179(2), pages 424-443, June.
    6. Jalali, Hamed & Carmen, Raïsa & Van Nieuwenhuyse, Inneke & Boute, Robert, 2019. "Quality and pricing decisions in production/inventory systems," European Journal of Operational Research, Elsevier, vol. 272(1), pages 195-206.
    7. Stefan Creemers & Marc Lambrecht, 2010. "Queueing models for appointment-driven systems," Annals of Operations Research, Springer, vol. 178(1), pages 155-172, July.
    8. I. Van Nieuwenhuyse, 2008. "Lot sizing in stochastic flowshops. Striking the balance between capacity and flow," Review of Business and Economic Literature, KU Leuven, Faculty of Economics and Business (FEB), Review of Business and Economic Literature, vol. 0(2), pages 147-160.
    9. De Boeck, L. & Vandaele, N., 2008. "Coordination and synchronization of material flows in supply chains: An analytical approach," International Journal of Production Economics, Elsevier, vol. 116(2), pages 199-207, December.
    10. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    11. Kris Lieckens & Nico Vandaele, 2016. "Differential evolution to solve the lot size problem in stochastic supply chain management systems," Annals of Operations Research, Springer, vol. 242(2), pages 239-263, July.
    12. S. Creemers & M. Lambrecht & N. Vandaele, 2007. "Queueing Models in Healthcare," Review of Business and Economic Literature, KU Leuven, Faculty of Economics and Business (FEB), Review of Business and Economic Literature, vol. 0(3), pages 471-498.
    13. X.J. Wang & S.H. Choi, 2016. "Impacts of carbon emission reduction mechanisms on uncertain make-to-order manufacturing," International Journal of Production Research, Taylor & Francis Journals, vol. 54(11), pages 3311-3328, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Subba Rao, S. & Gunasekaran, A. & Goyal, S. K. & Martikainen, T., 1998. "Waiting line model applications in manufacturing," International Journal of Production Economics, Elsevier, vol. 54(1), pages 1-28, January.
    2. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
    3. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    4. El-Bouri, A. & Azizi, N. & Zolfaghari, S., 2007. "A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1894-1910, March.
    5. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    6. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    7. Edzard Weber & Anselm Tiefenbacher & Norbert Gronau, 2019. "Need for Standardization and Systematization of Test Data for Job-Shop Scheduling," Data, MDPI, vol. 4(1), pages 1-21, February.
    8. Kris Lieckens & Nico Vandaele, 2016. "Differential evolution to solve the lot size problem in stochastic supply chain management systems," Annals of Operations Research, Springer, vol. 242(2), pages 239-263, July.
    9. Zoghby, Jeriad & Wesley Barnes, J. & Hasenbein, John J., 2005. "Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches," European Journal of Operational Research, Elsevier, vol. 167(2), pages 336-348, December.
    10. Diarmuid Grimes & Emmanuel Hebrard, 2015. "Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 268-284, May.
    11. Mukherjee, Saral & Chatterjee Ashis K, 2002. "Applying Machine Based Decomposition in 2-Machine Flow Shops," IIMA Working Papers WP2002-08-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
    12. Sheen, Gwo-Ji & Liao, Lu-Wen, 2007. "A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags," European Journal of Operational Research, Elsevier, vol. 181(1), pages 102-116, August.
    13. Michael Pinedo & Marcos Singer, 1999. "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 1-17, February.
    14. F. Guerriero, 2008. "Hybrid Rollout Approaches for the Job Shop Scheduling Problem," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 419-438, November.
    15. Mascis, Alessandro & Pacciarelli, Dario, 2002. "Job-shop scheduling with blocking and no-wait constraints," European Journal of Operational Research, Elsevier, vol. 143(3), pages 498-517, December.
    16. Pezzella, Ferdinando & Merelli, Emanuela, 2000. "A tabu search method guided by shifting bottleneck for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 297-310, January.
    17. Francis Sourd & Wim Nuijten, 2000. "Multiple-Machine Lower Bounds for Shop-Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 341-352, November.
    18. Egon Balas & Alkis Vazacopoulos, 1998. "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling," Management Science, INFORMS, vol. 44(2), pages 262-275, February.
    19. Zijm, W. H. M. & Buitenhek, R., 1996. "Capacity planning and lead time management," International Journal of Production Economics, Elsevier, vol. 46(1), pages 165-179, December.
    20. Golenko-Ginzburg, Dimitri & Kesler, Shmuel & Landsman, Zinoviy, 1995. "Industrial job-shop scheduling with random operations and different priorities," International Journal of Production Economics, Elsevier, vol. 40(2-3), pages 185-195, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:44:y:1998:i:11-part-1:p:1548-1561. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.