IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v40y1992i4p736-749.html
   My bibliography  Save this article

The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups

Author

Listed:
  • Gregory Dobson

    (University of Rochester, Rochester, New York)

Abstract

In this paper, we formulate the cyclic lot scheduling problem on a single facility with sequence-dependent setup costs and times and provide a heuristic solution procedure. A Lagrangian relaxation of the formulation leads to a partial separation of the embedded lot sizing and traveling salesman problems. The relaxation results in a new combinatorial problem related to the minimum spanning tree problem. The information about frequency of production, gained from the solution to this relaxation, is used to find heuristic solutions for the entire problem. Computational work on randomly generated problems shows that the problem becomes more difficult as the diversity in the sequence-dependent parameters increases.

Suggested Citation

  • Gregory Dobson, 1992. "The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups," Operations Research, INFORMS, vol. 40(4), pages 736-749, August.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:4:p:736-749
    DOI: 10.1287/opre.40.4.736
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.4.736
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.4.736?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
    ---><---

    Citations

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


    Cited by:

    1. Drexl, Andreas & Kimms, Alf, 1996. "Lot sizing and scheduling: Survey and extensions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 421, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Bouchriha, Hanen & Ouhimmou, Mustapha & D'Amours, Sophie, 2007. "Lot sizing problem on a paper machine under a cyclic production approach," International Journal of Production Economics, Elsevier, vol. 105(2), pages 318-328, February.
    3. Goncalves, JoseF. & Leachman, Robert C., 1998. "A hybrid heuristic and linear programming approach to multi-product machine scheduling," European Journal of Operational Research, Elsevier, vol. 110(3), pages 548-563, November.
    4. Leven, Erik & Segerstedt, Anders, 2007. "A scheduling policy for adjusting economic lot quantities to a feasible solution," European Journal of Operational Research, Elsevier, vol. 179(2), pages 414-423, June.
    5. Haase, Knut & Kimms, Alf, 2000. "Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities," International Journal of Production Economics, Elsevier, vol. 66(2), pages 159-169, June.
    6. McGee, Victor E. & Pyke, David F., 1996. "Periodic production scheduling at a fastener manufacturer," International Journal of Production Economics, Elsevier, vol. 46(1), pages 65-87, December.
    7. Vladimir Krasik & Joseph Leung & Michael Pinedo & Jiawei Zhang, 2008. "Scheduling multiple products on parallel machines with setup costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 654-669, October.
    8. Wagner, Bret J. & Davis, Darwin J., 2002. "A search heuristic for the sequence-dependent economic lot scheduling problem," European Journal of Operational Research, Elsevier, vol. 141(1), pages 133-146, August.
    9. Sungmin Kang & Kavindra Malik & L. Joseph Thomas, 1999. "Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs," Management Science, INFORMS, vol. 45(2), pages 273-289, February.
    10. Haase, Knut, 1994. "Capacitated lot-sizing with sequence dependent setup costs," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 340, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Daniel Adelman & Christiane Barz, 2014. "A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 374-402, May.
    12. Haase, Knut & Kimms, Alf, 1996. "Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 393, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Kirschstein, Thomas, 2018. "Planning of multi-product pipelines by economic lot scheduling models," European Journal of Operational Research, Elsevier, vol. 264(1), pages 327-339.
    14. Mili Mehrotra & Milind Dawande & Srinagesh Gavirneni & Mehmet Demirci & Sridhar Tayur, 2011. "OR PRACTICE---Production Planning with Patterns: A Problem from Processed Food Manufacturing," Operations Research, INFORMS, vol. 59(2), pages 267-282, April.
    15. Löhndorf, Nils & Riel, Manuel & Minner, Stefan, 2014. "Simulation optimization for the stochastic economic lot scheduling problem with sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 157(C), pages 170-176.
    16. Franca, Paulo M. & Gendreau, Michel & Laporte, Gilbert & Muller, Felipe M., 1996. "A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 43(2-3), pages 79-89, June.

    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:oropre:v:40:y:1992:i:4:p:736-749. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.