𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Greedy randomised dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

✍ Scribed by Jorge M. S. Valente; Maria R. A. Moreira

Publisher
Springer
Year
2009
Tongue
English
Weight
234 KB
Volume
44
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A note on β€œBeam search heuristics for th
A note on β€œBeam search heuristics for the single machine early/tardy scheduling problem with no machine idle time”
✍ F. Della Croce; E. Desmier; T. Garaix πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 171 KB

In a recent paper by Valente ''Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time" ', Computers & Industrial Engineering, 55, 663-675, 2008, several beam search approaches are compared on a large set of instances of the total weighted earlinesstard