✦ LIBER ✦

Online scheduling on two uniform machines to minimize the makespan

✍ Scribed by Ming Liu; Yinfeng Xu; Chengbin Chu; Feifeng Zheng

Book ID: 108281525
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 650 KB
Volume: 410
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.01.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi-online scheduling on two uniform ma

Semi-online scheduling on two uniform machines with

✍ Sheng-Yi Cai; Qi-Fan Yang 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 592 KB

Online scheduling on two uniform machine

Online scheduling on two uniform machines subject to eligibility constraints

✍ Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 545 KB

Scheduling on uniform parallel machines

Scheduling on uniform parallel machines to minimize maximum lateness

✍ Christos Koulamas; George J. Kyparisis 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 91 KB

Batching and scheduling to minimize the

Batching and scheduling to minimize the makespan in the two-machine flowshop

✍ T.C. Edwin Cheng; Guoqing Wang 📂 Article 📅 1999 🏛 Taylor and Francis Group 🌐 English ⚖ 222 KB

Makespan minimization in the two-machine

Makespan minimization in the two-machine flowshop batch scheduling problem

✍ T.C.E. Cheng; B.M.T. Lin; A. Toker 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 2 views

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part-types are to be produced in a flexible manufacturing cell organized into a two-stage production line. The jobs are processed in batches on the first

Scheduling jobs with release dates and t

Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan

✍ Giuseppe Lancia 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 168 KB