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

The Weighted Total Tardiness Problem with Fixed Shipping Times and Overtime Utilization

Author

Listed:
  • Hirofumi Matsuo

    (The University of Texas at Austin, Austin, Texas)

Abstract

This paper addresses the problem of simultaneously determining overtime utilization and job sequencing over a finite planning horizon in a single machine job shop environment. Shipping times are assumed to occur at fixed and specified points in time, and their number is much smaller than the number of jobs. The goal is to find an overtime utilization level and job sequence that yields a “good” tradeoff between overtime cost and tardiness penalties. We begin by showing that the problem in its simplest form is NP-hard. We then present an approximate algorithm based on a capacitated transshipment formulation. This approximation provides a feasible solution along with its error bound. The algorithm is refined by incorporating the dominance relations of jobs. Extensive computational experience indicates that the algorithm is implementable in terms of both speed and accuracy.

Suggested Citation

  • Hirofumi Matsuo, 1988. "The Weighted Total Tardiness Problem with Fixed Shipping Times and Overtime Utilization," Operations Research, INFORMS, vol. 36(2), pages 293-307, April.
  • Handle: RePEc:inm:oropre:v:36:y:1988:i:2:p:293-307
    DOI: 10.1287/opre.36.2.293
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.36.2.293
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.36.2.293?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. Chen, Bo & Lee, Chung-Yee, 2008. "Logistics scheduling with batching and transportation," European Journal of Operational Research, Elsevier, vol. 189(3), pages 871-876, September.
    2. Feng Li & Zhi-Long Chen & Zhi-Long Chen, 2017. "Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 232-250, May.
    3. Haiyan Wang & Chung‐Yee Lee, 2005. "Production and transport logistics scheduling with two transport mode choices," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 796-809, December.
    4. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    5. Han, Dongya & Yang, Yongjian & Wang, Dujuan & Cheng, T.C.E. & Yin, Yunqiang, 2019. "Integrated production, inventory, and outbound distribution operations with fixed departure times in a three-stage supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 334-347.
    6. Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.
    7. Andreas C. Nearchou, 2018. "Multicriteria scheduling optimization using an elitist multiobjective population heuristic: the h-NSDE algorithm," Journal of Heuristics, Springer, vol. 24(6), pages 817-851, December.
    8. Nicholas G. Hall & 'Maseka Lesaoana & Chris N. Potts, 2001. "Scheduling with Fixed Delivery Dates," Operations Research, INFORMS, vol. 49(1), pages 134-144, February.
    9. Chhajed, Dilip, 1995. "A fixed interval due-date scheduling problem with earliness and due-date costs," European Journal of Operational Research, Elsevier, vol. 84(2), pages 385-401, July.

    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:36:y:1988:i:2:p:293-307. 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.