zbMATH — the first resource for mathematics

Scheduling deteriorating jobs on a single processor. (English) Zbl 0703.90051
Summary: N jobs are to be processed sequentially on a single machine. While waiting for processing, jobs deteriorate, causing the random processing requirement of each job to grow at a job-specific rate. Under such conditions, the actual processing times of the jobs are no longer exchangeable random variables and the expected makespan is no longer invariant under any scheduling strategy that disallows idleness. In this paper, we analyze the effects of different deterioration schemes and derive optimal scheduling policies that minimize the expected makespan, and, for some models, policies that minimize the variance of the makespan. We also allow for random setup and detaching times. Applications to optimal inventory issuing policies are discussed and extensions are considered.

90B35 Deterministic scheduling theory in operations research
90B05 Inventory, storage, reservoirs
Full Text: DOI