𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing number of tardy jobs on a single machine subject to periodic maintenance

✍ Scribed by Wen-Jinn Chen

Book ID
113830635
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
169 KB
Volume
37
Category
Article
ISSN
0305-0483

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

Minimizing mean tardiness subject to uns
Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine
✍ M. Ben-Daya; S.O. Duffuaa; A. Raouf πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 655 KB

In this paper we propose a hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs. Although the minimum number of tardy jobs is known, the subset of tardy job is not known. The proposed algorithm use