𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing the number of late jobs when the start time of the machine is variable

✍ Scribed by Han Hoogeveen; Vincent T’kindt

Book ID
119340199
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
212 KB
Volume
40
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing the number of tardy jobs in s
Minimizing the number of tardy jobs in single machine sequencing
✍ Ahmad H. Sharary; Nejib Zaguia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 568 KB

A set P of n jobs has to be processed without preemption, one job at a time, on a single machine. The weight and processing time of each job is one. Furthermore, the jobs are subject to precedence constraints represented by a given ordered set (P, <). In a feasible schedule a job is called a tardy j

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