Scheduling problems with random processing times under expected earliness/tardiness costs

This work is concerned with scheduling problems for a single machine. Taking earliness and tardiness of completion time and due-date value into consideration, the objective function with a common due date is considered. The processing time of each job is random. Sufficient conditions guaranteeing an...

Full description

Saved in:
Bibliographic Details
Published inStochastic analysis and applications Vol. 18; no. 3; pp. 453 - 473
Main Authors Qi, X.D., Yin, G., Birge, J.R.
Format Journal Article
LanguageEnglish
Published Philadelphia, PA Marcel Dekker, Inc 2000
Taylor & Francis
Subjects
Applied sciences
Due Date
Earliness
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Random Processing Time
Reliability theory. Replacement problems
SEPT
Stochastic Scheduling
Tardiness
Existence theorem
Exponential distribution
Gaussian distribution
Processing time
Scheduling
Makespan
Uniqueness theorem
Delay
Optimal schedule
Sufficient condition
Optimal solution
Earliness
Single machine
Online AccessGet full text

Cover

More Information
Summary:This work is concerned with scheduling problems for a single machine. Taking earliness and tardiness of completion time and due-date value into consideration, the objective function with a common due date is considered. The processing time of each job is random. Sufficient conditions guaranteeing an optimal SEPT sequence are derived. Under exponential and normal processing times, further results are obtained
ISSN:0736-2994
1532-9356
DOI:10.1080/07362990008809680