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

Single-machine scheduling with simple linear deterioration to minimize earliness penalties

โœ Scribed by Dan Wang; Ji-Bo Wang

Publisher
Springer
Year
2009
Tongue
English
Weight
225 KB
Volume
46
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling a single machine to minimize
Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
โœ Xiangton Qi; Feng-Sheng Tu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 404 KB

This paper considers a single machine scheduling problem. There are n jobs to be processed on a single machine. The problem is to minimize total earliness penalties subject to no tardy jobs. The problem is NP-complete if the due-dates are arbitrary. We study the problem when the due-dates are determ

Adjacent orderings in single-machine sch
Adjacent orderings in single-machine scheduling with earliness and tardiness penalties
โœ Wlodzimierz Szwarc ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 771 KB

This article deals with a single-machine n job earliness-tardiness model with jobindependent penalties. It demonstrates that the arrangement of adjacent jobs in an optimal schedule depends on a critical value of the start times. Based on these precedence relations, the article develops criteria unde