✦ LIBER ✦

Scheduling stochastic job shop subject to random breakdown to minimize makespan

✍ Scribed by Deming Lei

Book ID: 105854173
Publisher: Springer
Year: 2011
Tongue: English
Weight: 209 KB
Volume: 55
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-010-3151-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing makespan for scheduling stoch

Minimizing makespan for scheduling stochastic job shop with random breakdown

✍ De-ming Lei 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 330 KB

Scheduling of a hub reentrant job shop t

Scheduling of a hub reentrant job shop to minimize makespan

✍ Xie Xie; Lixin Tang; Yanping Li 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 598 KB

Scheduling deteriorating jobs to minimiz

Scheduling deteriorating jobs to minimize makespan

✍ Wieslaw Kubiak; Steef van de Velde 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J j grows by w j with each time unit its start is delayed beyond a given common critical date d. This processing time is p j if J j starts by d. We show that this problem i

Flow shop scheduling to minimize makespa

Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times

✍ Xiao-Yuan Wang; Ming-Zheng Wang; Ji-Bo Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 194 KB

Predictable scheduling of a job shop sub

Predictable scheduling of a job shop subject to breakdowns

✍ Mehta, S.V.; Uzsoy, R.M. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 523 KB

Scheduling parallel jobs to minimize the

Scheduling parallel jobs to minimize the makespan

✍ Berit Johannes 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 412 KB