✦ LIBER ✦

Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs

✍ Scribed by Jorge M. S. Valente; Maria R. A. Moreira; Alok Singh; Rui A. F. S. Alves

Publisher: Springer
Year: 2010
Tongue: English
Weight: 237 KB
Volume: 54
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-010-2921-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Greedy heuristics for single-machine sch

Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs

✍ Awi Federgruen; Gur Mosheiov 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 578 KB

Efficient algorithms for machine schedul

Efficient algorithms for machine scheduling problems with earliness and tardiness penalties

✍ Guang Feng; Hoong Chuin Lau 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 393 KB

Earliness and tardiness single machine s

Earliness and tardiness single machine scheduling with proportional weights

✍ Wlodzimierz Szwarc; Samar K. Mukhopadhyay 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 535 KB

Single-machine scheduling with early and

Single-machine scheduling with early and tardy completion costs

✍ J. Steve Davis; John J. Kanet 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 930 KB

We address a single-machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early com

Single-machine scheduling with time wind

Single-machine scheduling with time windows and earliness/tardiness penalties

✍ Christos Koulamas 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 876 KB

Greedy randomised dispatching heuristics

Greedy randomised dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

✍ Jorge M. S. Valente; Maria R. A. Moreira 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 234 KB