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

Uttarayan Bagchi, François M. Julien and Michael J. Magazine
Additional contact information
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

Management Science, 1994, vol. 40, issue 10, 1389-1392

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.

Keywords: scheduling; due-date assignment; order sequencing (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.40.10.1389 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:40:y:1994:i:10:p:1389-1392

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().