IDEAS home Printed from https://ideas.repec.org/p/tin/wpaper/19990036.html
   My bibliography  Save this paper

Improved Dynamic Programs for Some Batching Problems involving the Maximum Lateness Criterion

Author

Listed:
  • A.P.M. Wagelmans

    (Erasmus University Rotterdam)

  • A.E. Gerodimos

    (Imperial College, London)

Abstract

We study a class of scheduling problems involving the maximumlateness criterion and an element of batching. For all the problemsthat we examine, algorithms appear in the literature which consistof a sorting step to determine an optimal job sequence, followedby a dynamic programming step which determines the optimal batches.In each case, the dynamic program is based on a backward recursionof which a straightfoward implementation requires O(n^2) time, wheren is the number of jobs. We present improved implementations of thesedynamic programs that are based on monotonicity properties of theobjective expressed as a function of the length of the first batch.These properties and the use of efficient data structures enable usto exclude partial schedules that cannot lead to an overall optimumearly on in the enumeration process. The four problems that weconsider are solved in O(n log n) time; in two occasions, thebatching step is actually performed in linear time and the overallcomplexity is determined by the sorting step.

Suggested Citation

  • A.P.M. Wagelmans & A.E. Gerodimos, 1999. "Improved Dynamic Programs for Some Batching Problems involving the Maximum Lateness Criterion," Tinbergen Institute Discussion Papers 99-036/4, Tinbergen Institute.
    • Handle: RePEc:tin:wpaper:19990036
    as

    Download full text from publisher

    File URL: https://papers.tinbergen.nl/99036.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. van Hoesel, Stan & Wagelmans, Albert & Moerman, Bram, 1994. "Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions," European Journal of Operational Research, Elsevier, vol. 75(2), pages 312-331, June.
    2. Albert Wagelmans & Stan van Hoesel & Antoon Kolen, 1992. "Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case," Operations Research, INFORMS, vol. 40(1-supplem), pages 145-156, February.
    3. Awi Federgruen & Michal Tzur, 1991. "A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time," Management Science, INFORMS, vol. 37(8), pages 909-925, August.
    4. Alok Aggarwal & James K. Park, 1993. "Improved Algorithms for Economic Lot Size Problems," Operations Research, INFORMS, vol. 41(3), pages 549-571, June.
    5. Scott Webster & Kenneth R. Baker, 1995. "Scheduling Groups of Jobs on a Single Machine," Operations Research, INFORMS, vol. 43(4), pages 692-703, August.
    Full references (including those not matched with items on IDEAS)

    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. Hark‐Chin Hwang & Wilco van den Heuvel, 2012. "Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
    2. Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
    3. Hark-Chin Hwang, 2009. "Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy," Transportation Science, INFORMS, vol. 43(2), pages 244-264, May.
    4. Hwang, Hark-Chin & Kang, Jangha, 2021. "An improved algorithm for the lot-sizing problem with outbound shipment," Omega, Elsevier, vol. 100(C).
    5. van den Heuvel, W.J. & Wagelmans, A.P.M., 2003. "A geometric algorithm to solve the NI/G/NI/ND capacitated lot-sizing problem in O(T2) time," Econometric Institute Research Papers EI 2003-24, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Hwang, H.C., 2009. "Economic Lot-Sizing Problem with Bounded Inventory and Lost-Sales," Econometric Institute Research Papers EI 2009-01, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    7. Passchyn, Ward & Coene, Sofie & Briskorn, Dirk & Hurink, Johann L. & Spieksma, Frits C.R. & Vanden Berghe, Greet, 2016. "The lockmaster’s problem," European Journal of Operational Research, Elsevier, vol. 251(2), pages 432-441.
    8. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    9. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
    10. Martel, Alain & Gascon, Andre, 1998. "Dynamic lot-sizing with price changes and price-dependent holding costs," European Journal of Operational Research, Elsevier, vol. 111(1), pages 114-128, November.
    11. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    12. Nadjib Brahimi & Stéphane Dauzère-Pérès & Najib M. Najid, 2006. "Capacitated Multi-Item Lot-Sizing Problems with Time Windows," Operations Research, INFORMS, vol. 54(5), pages 951-967, October.
    13. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    14. Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2013. "Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem," Operations Research, INFORMS, vol. 61(2), pages 469-482, April.
    15. van den Heuvel, W. & Kundakcioglu, O.E. & Geunes, J. & Romeijn, H.E. & Sharkey, T.C. & Wagelmans, A.P.M., 2007. "Integrated market selection and production planning: complexity and solution approaches," Econometric Institute Research Papers EI 2007-45, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    16. Heuvel, Wilco van den & Borm, Peter & Hamers, Herbert, 2007. "Economic lot-sizing games," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1117-1130, January.
    17. Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
    18. Goisque, Guillaume & Rapine, Christophe, 2017. "An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels," European Journal of Operational Research, Elsevier, vol. 261(3), pages 918-928.
    19. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    20. Bian, Yuan & Lemoine, David & Yeung, Thomas G. & Bostel, Nathalie & Hovelaque, Vincent & Viviani, Jean-laurent & Gayraud, Fabrice, 2018. "A dynamic lot-sizing-based profit maximization discounted cash flow model considering working capital requirement financing cost with infinite production capacity," International Journal of Production Economics, Elsevier, vol. 196(C), pages 319-332.

    More about this item

    Statistics

    Access and download statistics

    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:tin:wpaper:19990036. 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: Tinbergen Office +31 (0)10-4088900 (email available below). General contact details of provider: https://edirc.repec.org/data/tinbenl.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.