✦ LIBER ✦

Batch sizing and job sequencing on a single machine

✍ Scribed by E. G. Coffman; M. Yannakakis; M. J. Magazine; C. Santos

Book ID: 112718212
Publisher: Springer US
Year: 1990
Tongue: English
Weight: 582 KB
Volume: 26
Category: Article
ISSN: 0254-5330
DOI: 10.1007/bf02248589

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integrated batch sizing and scheduling o

Integrated batch sizing and scheduling on a single machine

✍ Philippe Chrétienne; Öncü Hazır; Safia Kedad-Sidhoum 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 701 KB

Minimizing makespan on a single batch pr

Minimizing makespan on a single batch processing machine with nonidentical job sizes

✍ Guochuan Zhang; Xiaoqiang Cai; C.-Y Lee; C.K Wong 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

Scheduling a single batch processing mac

Scheduling a single batch processing machine with non-identical job sizes

✍ UZSOY, R. 📂 Article 📅 1994 🏛 Taylor and Francis Group 🌐 English ⚖ 721 KB

A note on minimizing makespan on a singl

A note on minimizing makespan on a single batch processing machine with nonidentical job sizes

✍ Ali Husseinzadeh Kashan; Behrooz Karimi; S.M.T. Fatemi Ghomi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 360 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.

On-line problems of minimizing makespan

On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes

✍ Shi Yongqiang; Yao Enyu 📂 Article 📅 2005 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 348 KB