Job Shop Scheduling with Due Dates and Variable Processing Times

C. A. Holloway and R. T. Nelson
Additional contact information
C. A. Holloway: Stanford University
R. T. Nelson: University of California, Los Angeles

Management Science, 1974, vol. 20, issue 9, 1264-1275

Abstract: A multi-pass heuristic scheduling procedure developed for job scheduling problems with deterministic processing times is tested with processing times that are random variables. The heuristic procedure, which uses expected processing times, typically generates a delay schedule (i.e., a schedule in which some operations are delayed while the machine to process these operations is kept idle awaiting the arrival of another operation). Simulation is employed to compare the performance of the schedule generated by the heuristic procedure, a nondelay transformation of that schedule, and the nondelay schedules obtained with four single-pass dispatching rules. The criteria employed are fraction of jobs tardy, mean tardiness, variance of tardiness, and maximum tardiness. The delay schedule produced by the heuristic procedure was found to be markedly superior under certain conditions. Under other conditions, the relative performance of the scheduling rules appears highly problem dependent. Implications of these results are discussed with respect to further research.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.9.1264 (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:20:y:1974:i:9:p:1264-1275

Access Statistics for this article

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