✦ LIBER ✦

A new lower bound approach for single-machine multicriteria scheduling

✍ Scribed by J.A Hoogeveen; S.L van de Velde

Book ID: 107918228
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 429 KB
Volume: 11
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(92)90060-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for single-machine scheduli

Lower bounds for single-machine scheduling problems

✍ Reza H. Ahmadi; Uttarayan Bagchi 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 588 KB

Lower bounds for on-line single-machine

Lower bounds for on-line single-machine scheduling

✍ Leah Epstein; Rob van Stee 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 158 KB

A branch and bound approach for single m

A branch and bound approach for single machine scheduling with earliness and tardiness penalties

✍ Pei Chann Chang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 660 KB

An n job, single machine scheduling problem in which each job has a distinct due date, dd, is studied in this paper. The objective is to determine an optimal schedule Ir ° for a set of jobs, S, such that the total absolute deviation of the schedule is minimized. This objective function is based on t

A robust approach for the single machine

A robust approach for the single machine scheduling problem

✍ Cyril Briand; H. Trung La; Jacques Erschler 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 663 KB

On the equivalence of the max-min transp

On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

✍ Yunpeng Pan; Leyuan Shi 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 220 KB

A lower bound for on-line scheduling on

A lower bound for on-line scheduling on uniformly related machines

✍ Leah Epstein; Jiřı́ Sgall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 75 KB