๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

โœ Scribed by Hamilton Emmons

Book ID
111939661
Publisher
INFORMS
Year
1969
Tongue
English
Weight
423 KB
Volume
17
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A hybrid algorithm for the one machine s
A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
โœ V. Srinivasan ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 568 KB

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relatio

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