✦ LIBER ✦

Scheduling jobs with piecewise linear decreasing processing times

✍ Scribed by T.C. Edwin Cheng; Qing Ding; Mikhail Y. Kovalyov; Aleksander Bachman; Adam Janiak

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 173 KB
Volume: 50
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.10073

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Flow-shop batch scheduling with identica

Flow-shop batch scheduling with identical processing-time jobs

✍ Gur Mosheiov; Daniel Oron; Yaacov Ritov 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB

Scheduling jobs, with exponentially dist

Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop

✍ Andrew A. Cunningham; Sujit K. Dutta 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 450 KB

Scheduling tasks with sequence-dependent

Scheduling tasks with sequence-dependent processing times

✍ Lucio Bianco; Salvatore Ricciardelli; Giovanni Rinaldi; Antonio Sassano 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB

A single-machine scheduling problem with

A single-machine scheduling problem with random processing times

✍ S. Chakravarthy 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB

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

Sequencing n jobs on two machines with s

Sequencing n jobs on two machines with setup, processing and removal times separated

✍ Dileep R. Sule 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB