✦ LIBER ✦

A fast heuristic to minimize number of tardy jobs in preemptive open shops

✍ Scribed by Liaw, Ching-Fang

Book ID: 121489722
Publisher: Informa UK (Taylor & Francis)
Year: 2014
Tongue: English
Weight: 253 KB
Volume: 31
Category: Article
ISSN: 2168-1015
DOI: 10.1080/21681015.2013.879395

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Concurrent Open Shop Scheduling to Minim

Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs

✍ C. T. Ng; T. C. E. Cheng; J. J. Yuan 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 113 KB

Scheduling algorithms to minimize the nu

Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops

✍ Hyun-Seon Choi; Dong-Ho Lee 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 267 KB

A heuristic procedure to minimize number

A heuristic procedure to minimize number of tardy jobs and total tardiness in single machine scheduling

✍ Gursel A. Suer; Zbigniew Czajkiewicz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Scheduling unit time open shops to minim

Scheduling unit time open shops to minimize the weighted number of late jobs

✍ Peter Brucker; Bernd Jurisch; Thomas Tautenhahn; Frank Werner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 365 KB

A shifting bottleneck heuristic for mini

A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop

✍ Michael Pinedo; Marcos Singer 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB 👁 2 views

We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single-machine subproblems that are solved one after another. Each machine is scheduled according to the solution of its corresponding subproblem.

A modified shifting bottleneck heuristic

A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops

✍ Scott J. Mason; John W. Fowler; W. Matthew Carlyle 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 138 KB

Increases in the demand for integrated circuits have highlighted the importance of meeting customer quality and on-time delivery expectations in the semiconductor industry. A modiÿed shifting bottleneck heuristic is developed for minimizing the total weighted tardiness in a semiconductor wafer fabri