𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling || A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times

✍ Scribed by Hiroshi Kise, Toshihide Ibaraki and Hisashi Mine

Book ID
123686561
Publisher
INFORMS
Year
1978
Tongue
English
Weight
226 KB
Volume
26
Category
Article
ISSN
0030-364X

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