✦ LIBER ✦

On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation

✍ Scribed by Philippe Baptiste; Ruslan Sadykov

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 185 KB
Volume: 56
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.20352

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single-Machine Scheduling to Minimize a

Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

✍ J.A. Hoogeveen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 210 KB

We consider the problem of scheduling n jobs on a single machine that is continuously available from time zero onward and that can handle no more than one job at a time. Each job requires processing during a given positive uninter-Ž . rupted time. The cost of each job is measured by K Ks2, 3 nondecr

Scheduling on a single machine with a si

Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

✍ I. Adiri; E. Frostig; A. H. G. Rinnooy Kan 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB 👁 2 views

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