𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times

✍ Scribed by Tung-I Tsai

Publisher
Springer
Year
2006
Tongue
English
Weight
151 KB
Volume
31
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Search heuristics for a parallel machine
Search heuristics for a parallel machine scheduling problem with ready times and due dates
✍ Moon-Won Park; Yeong-Dae Kim πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 348 KB

We consider a problem of scheduling orders on identical parallel machines An order can be released after a given ready time and must be completed before its due date An order is split into multiple jobs (batches) and a job is processed on one of the parallel machines The objective of the scheduling

A moving block heuristic for minimizing
A moving block heuristic for minimizing earliness and tardiness on a single machine with unrestrictive common due dates
✍ Scott J. Mason; Song Jin; Jagadish Jampani πŸ“‚ Article πŸ“… 2005 πŸ› Society of Manufacturing Engineers 🌐 English βš– 1013 KB

A moving block heuristic (MBH) is developed for earliness-tardiness scheduling problems, which are observed in just-in-time (JIT) production environments. The MBH is described for the single-machine environment under unrestrictive job due date conditions. The proposed MBH, which has polynomial compu

Sequencing and due-date determination in
Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
✍ Soroush H.M. πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 215 KB

This paper studies the problem of simultaneous due-date determination and sequencing of a set of n jobs on a single machine where processing times are random variables and job earliness and tardiness costs are distinct. The objective is to determine the optimal sequence and the optimal due-dates whi