✦ LIBER ✦

Open shop scheduling problem to minimize makespan with release dates

✍ Scribed by Bai, Danyu; Tang, Lixin

Book ID: 119191599
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 360 KB
Volume: 37
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2012.04.037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note: Open-shop scheduling with release

Note: Open-shop scheduling with release dates to minimize maximum lateness

✍ Hans Kellerer; Thomas Tautenhahn; Gerhard Woeginger 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 2 views

We present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness. 0 I995 John Wiley & Sons. Inc.

Single machine batch scheduling problem

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

✍ J. J. Yuan; Z. H. Liu; C. T. Ng; T. C. E. Cheng 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 315 KB

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

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

Scheduling jobs with release dates on pa

Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan

✍ L. L. Liu, C. T. Ng, T. C. E. Cheng 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 185 KB

Minimizing the makespan in open-shop sch

Minimizing the makespan in open-shop scheduling problems with a convex resource consumption function

✍ Dvir Shabtay; Moshe Kaspi 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB