✦ LIBER ✦

Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints

✍ Scribed by B.M.T. Lin; T.C.E. Cheng

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 216 KB
Volume: 116
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(98)00196-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing the number of tardy jobs with

Minimizing the number of tardy jobs with precedence constraints and agreeable due dates

✍ George Steiner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 713 KB

## Minimizing the number of precedence constrained, unit-time tardy jobs is strongly NP-hard on a single machine. We study a special case of the problem where a job is tardy if it is finished more than a fixed K time units after its earliest possible completion time under the precedence constraint

Two-machine flow shop scheduling with co

Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

✍ Wing-Kwan Yeung; Ceyda Oğuz; Tai-Chiu Edwin Cheng 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

On the minimization of the weighted numb

On the minimization of the weighted number of tardy jobs with random processing times and deadline

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

A note on minimizing the weighted sum of

A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date

✍ Bahram Alidaee; Irinel Dragan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 300 KB