✦ LIBER ✦

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs

✍ Scribed by H. A. J. Crauwels; C. N. Potts; D. Van Oudheusden; L. N. Van Wassenhove

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 395 KB
Volume: 8
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-005-6365-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Branch and Bound Algorithms for Single M

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs

✍ H. A. J. Crauwels; C. N. Potts; D. Van Oudheusden; L. N. Van Wassenhove 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 395 KB

Single machine batch scheduling to minim

Single machine batch scheduling to minimize the weighted number of late jobs

✍ Peter Brucker; Mikhail Y. Kovalyov 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 419 KB

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

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

Single machine scheduling to minimize th

Single machine scheduling to minimize the number of early and tardy jobs

✍ Avital Lann; Gur Mosheiov 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 913 KB

A branch and bound algorithm for single

A branch and bound algorithm for single machine scheduling with deteriorating values of jobs

✍ Theodore G. Voutsinas; Costas P. Pappis 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Scheduling deteriorating jobs is an area of research which has attracted much attention recently. In this paper the problem of single machine scheduling, where the values of jobs remaining after processing deteriorate over time, is presented. A branch and bound method is developed, which, using the