Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue

Lawrence M. Wein
Additional contact information
Lawrence M. Wein: Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139

Management Science, 1991, vol. 37, issue 7, 834-850

Abstract: The problem of simultaneous due-date setting and priority sequencing is analyzed in the setting of a multiclass M/G/1 queueing system. The objective is to minimize the weighted average due-date lead time (due-date minus arrival date) of jobs subject to a constraint on either the fraction of tardy jobs or the average job tardiness. Several parametric and nonparametric due-date setting policies are proposed that depend on the class of arriving job, the state of the queueing system at the time of the job's arrival, and the sequencing policy (the weighted shortest expected processing time rule) that is used. In a simulation experiment performed on a two-class M/M/1 system, these policies outperformed traditional due-date setting policies, and due-date setting had a larger impact on performance than priority sequencing.

Keywords: production/scheduling; queues (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (30)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.37.7.834 (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:37:y:1991:i:7:p:834-850

Access Statistics for this article

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