𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing the number of late jobs on unrelated machines

✍ Scribed by Jianzhong Du; Joseph Y.-T Leung

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
413 KB
Volume
10
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Open shop scheduling to minimize the num
Open shop scheduling to minimize the number of late jobs
✍ Christos Koulamas; George J. Kyparisis πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 63 KB πŸ‘ 2 views

We develop polynomial algorithms for several cases of the NP-hard open shop scheduling problem of minimizing the number of late jobs by utilizing some recent results for the open shop makespan problem. For the two machine common due date problem, we assume that either the machines or the jobs are or

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