✦ LIBER ✦

Single machine scheduling to minimize mean absolute lateness: A heuristic solution

✍ Scribed by Timothy D. Fry; Ronald D. Armstrong; L. Drew Rosen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing the sum of absolute lateness

✍ P. S. Sundararaghavan; Mesbah U. Ahmed 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 424 KB

Approximation algorithms for scheduling

✍ C.N Potts; L.N Van Wassenhove 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A heuristic procedure to minimize number

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

Single-machine scheduling to minimize ab

✍ Wlodzimierz Szwarc 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB

A heuristic for parallel machine schedul

✍ Chung-Lun Li 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Heuristics for the two-machine flowshop

✍ Ali Allahverdi; Harun Aydilek 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 870 KB