✦ LIBER ✦

Comparing the minimum completion times of two longest-first scheduling-heuristics

✍ Scribed by Rico Walter

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi On-Line Scheduling Problem for Maxi

✍ Runzi Luo; Shijie Sun; Wenping Huang 📂 Article 📅 2006 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 168 KB

Shortest path to nonpreemptive schedules

✍ Philippe Baptiste; Vadim G. Timkovsky 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 309 KB

Comparative evaluation of heuristic algo

✍ Jatinder N. D. Gupta 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 740 KB

The two-stage assembly flowshop scheduli

✍ Ali Allahverdi; Fawaz S. Al-Anzi 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 235 KB

Two-machine flow shop scheduling with de

✍ Cheng, Mingbao; Tadikamalla, Pandu R; Shang, Jennifer; Zhang, Bixi 📂 Article 📅 2015 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 371 KB

Metronidazole: two or three times daily—

✍ C.J. Lloyd; P.D. Earl 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 374 KB