IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v40y1994i10p1389-1392.html
   My bibliography  Save this article

Note: Due-date Assignment to Multi-Job Customer Orders

Author

Listed:
  • Uttarayan Bagchi

    (Department of Management, The University of Texas at Austin, Austin, Texas 78712)

  • François M. Julien

    (University of Ottawa, Ottawa, Ontario, Canada)

  • Michael J. Magazine

    (Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1)

Abstract

The paper addresses deterministic, nonpreemptive scheduling of jobs that are immediately available for processing on a single machine. The jobs are partitioned into several multi-job customer orders. The problem is to determine a due-date for each customer order and to schedule all the jobs such that a total penalty function is minimized. The total penalty function is the sum of penalties for job earliness, penalties for job tardiness, and penalties associated with the lead times of customer orders. The main results is that there is an optimal solution in which the jobs within each customer order are processed contiguously. This is an appealing feature in terms of implementation. Efficient algorithms are presented for solving special cases of this problem.

Suggested Citation

  • Uttarayan Bagchi & François M. Julien & Michael J. Magazine, 1994. "Note: Due-date Assignment to Multi-Job Customer Orders," Management Science, INFORMS, vol. 40(10), pages 1389-1392, October.
  • Handle: RePEc:inm:ormnsc:v:40:y:1994:i:10:p:1389-1392
    DOI: 10.1287/mnsc.40.10.1389
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.40.10.1389
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.40.10.1389?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. Kedar S. Naphade & S. David Wu & Robert H. Storer & Bhavin J. Doshi, 2001. "Melt Scheduling to Trade Off Material Waste and Shipping Performance," Operations Research, INFORMS, vol. 49(5), pages 629-645, October.

    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:40:y:1994:i:10:p:1389-1392. 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.