✦ LIBER ✦

Partitioning of independent tasks for minimizing completion time and total waiting time

✍ Scribed by Zhang Zhongyun; Zhu Mingfa; Li Jie

Book ID: 112948399
Publisher: Springer
Year: 1991
Tongue: English
Weight: 299 KB
Volume: 6
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02945516

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing total completion time for UET

Minimizing total completion time for UET tasks with release time and outtree precedence constraints

✍ Yumei Huo; Joseph Y. -T. Leung 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 170 KB

Assignment of independent tasks to minim

Assignment of independent tasks to minimize completion time

✍ Ben A. Blake 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 721 KB

Some effective heuristics for no-wait fl

Some effective heuristics for no-wait flowshops with setup times to minimize total completion time

✍ Rubén Ruiz; Ali Allahverdi 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 693 KB

Quality of move-optimal schedules for mi

Quality of move-optimal schedules for minimizing total weighted completion time

✍ Tobias Brueggemann; Johann L. Hurink; Walter Kern 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 184 KB

We study the minimum total weighted completion time problem on identical machines. We analyze a simple local search heuristic, moving jobs from one machine to another. The local optima can be shown to be approximately optimal with approximation ratio 3 2 . In a special case, the approximation ratio

New heuristics for m-machine no-wait flo

New heuristics for m-machine no-wait flowshop to minimize total completion time

✍ Tariq Aldowaisan; Ali Allahverdi 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 222 KB

Minimizing Total Completion Time on Para

Minimizing Total Completion Time on Parallel Machines with Deadline Constraints

✍ Leung, Joseph Y. T.; Pinedo, Michael 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 276 KB