Earliness–tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods

Scheduling jobs with random processing t

Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties

✍ X. Cai; F. S. Tu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 942 KB

We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time ofeach job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objec