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

Optimal assignment of due-dates for preemptive single-machine scheduling

โœ Scribed by T.C.E. Cheng; V.S. Gordon

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
573 KB
Volume
20
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Two due date assignment problems in sche
Two due date assignment problems in scheduling a single machine
โœ Dvir Shabtay; George Steiner ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 199 KB

We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for so

Due-date assignment and single machine s
Due-date assignment and single machine scheduling with compressible processing times
โœ T.C.E. Cheng; C. Oวงuz; X.D. Qi ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 588 KB

In this paper we consider a due-date assignment and single machine scheduling problem in which the jobs have compressible processing times. Two models are defined according to the due-date assignment methods used. The first model applies the common (constant) due-date assignment method to assign the

Optimal assignment of slack due-dates an
Optimal assignment of slack due-dates and sequencing in a single-machine shop
โœ T.C.E. Cheng ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 194 KB

This paper considers the problem of optimal assignment of slack due-dates to n jobs and sequencing them on a single-machine to minimize a penalty function depending on the values of the assigned slack allowance and maximum job tardiness. It is shown that the earliest due-date order yields an optimal