✦ LIBER ✦

A note on minimizing maximum lateness in a one-machine sequencing problem with release dates

✍ Scribed by Eugeniusz Nowicki; Stanisław Zdrzałka

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 145 KB
Volume: 23
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(86)90247-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on a partial search algorithm for

A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

✍ T.C.E. Cheng 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Scheduling jobs with release times preem

Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs

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

A note on the single-machine scheduling

A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

✍ Suresh Chand; Hans Schneeberger 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th