𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times

✍ Scribed by Mateus Rocha de Paula; Geraldo Robson Mateus; Martín Gómez Ravetti

Book ID
108105956
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
195 KB
Volume
37
Category
Article
ISSN
0305-0548

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