✦ LIBER ✦

Minimizing late jobs in the general one machine scheduling problem

✍ Scribed by Stéphane Dauzère-Pérès

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 521 KB
Volume: 81
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)00116-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing the number of tardy jobs in i

Minimizing the number of tardy jobs in identical machine scheduling

✍ Gürsel A. Süer; Eduardo Báez; Zbigniew Czajkiewicz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 285 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

Minimizing the number of late jobs on un

Minimizing the number of late jobs on unrelated machines

✍ Jianzhong Du; Joseph Y.-T Leung 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 413 KB

The open shop scheduling problem with a

The open shop scheduling problem with a given sequence of jobs on one machine

✍ Y.M. Shafransky; V.A. Strusevich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a

A heuristic for parallel machine schedul

A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs

✍ Chung-Lun Li 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Minimizing the sum of absolute lateness

Minimizing the sum of absolute lateness in single-machine and multimachine scheduling

✍ P. S. Sundararaghavan; Mesbah U. Ahmed 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 424 KB