𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for machine scheduling problems with earliness and tardiness penalties

✍ Scribed by Guang Feng; Hoong Chuin Lau

Publisher
Springer US
Year
2007
Tongue
English
Weight
393 KB
Volume
159
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A branch and bound approach for single m
A branch and bound approach for single machine scheduling with earliness and tardiness penalties
✍ Pei Chann Chang πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 660 KB

An n job, single machine scheduling problem in which each job has a distinct due date, dd, is studied in this paper. The objective is to determine an optimal schedule Ir Β° for a set of jobs, S, such that the total absolute deviation of the schedule is minimized. This objective function is based on t