✦ LIBER ✦

Minimizing the number of late jobs on a single machine under due date uncertainty

✍ Scribed by Hassene Aissi; Mohamed Ali Aloulou; Mikhail Y. Kovalyov

Book ID: 106429673
Publisher: Springer US
Year: 2010
Tongue: English
Weight: 457 KB
Volume: 14
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-010-0183-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single machine scheduling to minimize th

Single machine scheduling to minimize the number of late jobs under uncertainty

✍ Shao Chin Sung; Milan Vlach 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 227 KB

In this paper, we deal with the problem of sequencing a ÿnite number of jobs for processing by a single machine with the objective of minimizing the number of jobs that are not completed by their due dates. We propose a rather general model based on an algebraic approach. By specifying suitable bina

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 weighted number of tardy

Minimizing the weighted number of tardy jobs on a single machine with release dates

✍ Rym M’Hallah; R.L. Bulfin 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 210 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

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 maximum absolute lateness and

Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine

✍ K. Tanaka; M. Vlach 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 210 KB