Setting due dates in a stochastic single machine environment

Authors:
Victor Portougal;Dan Trietsch
Affiliations:
ISOM Department, The University of Auckland, Private Bag 92019, Auckland, New Zealand;ISOM Department, The University of Auckland, Private Bag 92019, Auckland, New Zealand
Venue:
Computers and Operations Research
Year:
2006

Citing 2
Cited 5

Sequencing with earliness and tardiness penalties: a review

Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Single machine due date assignment scheduling problem with customer service level in fuzzy environment

Applied Soft Computing
Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine

Computers & Mathematics with Applications
Analysis of computer job control under uncertainty

Journal of Computer and Systems Sciences International
Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times

Computers and Operations Research
Competitive analysis for make-to-order scheduling with reliable lead time quotation

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

A set of n jobs with statistically independent random processing times has to be processed on a single machine without idling between jobs and without preemption. It is required to set due dates and promise them to customers. During the production stage, earliness and tardiness against the promised due dates will be penalized. The goal is to minimize the total expected penalties. We consider two due date setting procedures with optimum customer service level, and an O(nlogn) time complexity. We show that one is asymptotically optimal but the other is not. Both heuristics include safety time and the sequence remains the same regardless of disruptions, so the result is robust. For the normal distribution we provide sufficient optimality conditions, precedence relationships that the optimal sequence must obey, and tight bounds.