✦ LIBER ✦

Approximation results for a bicriteria job scheduling problem on a single machine without preemption

✍ Scribed by Eric Angel; Evripidis Bampis; Laurent Gourvès

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Simulated Annealing Approach to Bicrit

✍ Esra Köktener Karasakal; Murat Köksalan 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 73 KB

Some clarifications on the bicriteria sc

✍ Prabuddha De; Jay B. Ghosh; Charles E. Wells 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 403 KB

Complexity results for scheduling chains

✍ J.K. Lenstra; A.H.G. Rinnooy Kan 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 597 KB

Algorithms for some maximization schedul

✍ E. R. Gafarov; A. A. Lazarev; F. Werner 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 291 KB

A fuzzy multi-objective programming for

✍ M. Saidi Mehrabad; A. Pahlavani 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 839 KB

A look-ahead heuristic for scheduling jo

✍ Weizhen Mao; Rex K. Kincaid 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 908 KB