✦ LIBER ✦

Single machine batch scheduling problem with family setup times and release dates to minimize makespan

✍ Scribed by J. J. Yuan; Z. H. Liu; C. T. Ng; T. C. E. Cheng

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 315 KB
Volume: 9
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-006-8776-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bounded single-machine parallel-batc

The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan

✍ Q.Q. Nong; C.T. Ng; T.C.E. Cheng 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 155 KB

Parallel machine scheduling with release

Parallel machine scheduling with release dates, due dates and family setup times

✍ J.M.J. Schutten; R.A.M. Leussink 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Minimizing makespan in a two-machine flo

Minimizing makespan in a two-machine flowshop scheduling with batching and release time

✍ Lixin Tang; Peng Liu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 721 KB

Scheduling jobs with release dates and t

Scheduling jobs with release dates and tails on identical machines to minimize the makespan

✍ Jacques Carlier 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 618 KB

Minimizing makespan on a single batching

Minimizing makespan on a single batching machine with release times and non-identical job sizes

✍ Shuguang Li; Guojun Li; Xiaoli Wang; Qiming Liu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 214 KB

We consider the problem of scheduling jobs with release times and non-identical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worst-case ratio 2 + , where ¿ 0 can be made arbitrarily small.

A dynamic programming algorithm for the

A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times

✍ Alberto Bosio; Giovanni Righini 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 461 KB