𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing the number of tardy jobs for m parallel machines

✍ Scribed by Johnny C. Ho; Yih-Long Chang

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
794 KB
Volume
84
Category
Article
ISSN
0377-2217

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

Heuristics for minimizing mean tardiness
Heuristics for minimizing mean tardiness for m parallel machines
✍ Johnny C. Ho; Yih-Long Chang πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 791 KB

The concept of parallel operations has been widely used in manufacturing and data processing. However, not many efficient methods have been proposed to reduce job tardiness. This article proposes an efficient heuristic to minimize the mean tardiness of a set of tasks with known processing times and

Minimizing the number of tardy jobs unde
Minimizing the number of tardy jobs under piecewise-linear deterioration
✍ Ghasem Moslehi; Abbasali Jafari πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 343 KB

In this paper, we consider a single machine scheduling problem with piecewise-linear deterioration where its objective is to minimize the number of tardy jobs, in which the processing time of each job depends on its starting time where all the jobs have a specific deterioration rate. The problem is