✦ LIBER ✦

A time indexed formulation of non-preemptive single machine scheduling problems

✍ Scribed by Jorge P. Sousa; Laurence A. Wolsey

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The relation of time indexed formulation

✍ H. Waterer; E L. Johnson; P. Nobili; M.W.P. Savelsbergh 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 141 KB

A single-machine scheduling problem with

✍ S. Chakravarthy 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB

A unified formulation of the machine sch

✍ A.H. Land; G. Laporte; P. Miliotis 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 384 KB

Scheduling chains on a single machine wi

✍ Alix Munier; Francis Sourd 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 396 KB

Scheduling jobs with release times preem

✍ Nodari Vakhania 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 910 KB

A nondominated ranked genetic algorithm

✍ Keyhan Rahmani; Iraj Mahdavi; Hadi Moradi; Hamid Khorshidian; Maghsud Solimanpur 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 274 KB