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

Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs

โœ Scribed by Awi Federgruen; Gur Mosheiov

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
578 KB
Volume
16
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Single-machine scheduling with early and
Single-machine scheduling with early and tardy completion costs
โœ J. Steve Davis; John J. Kanet ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 930 KB

We address a single-machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early com

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