𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A search heuristic for just-in-time scheduling in parallel machines

✍ Scribed by Manuel Laguna; José Luis González Velarde

Publisher
Springer US
Year
1991
Tongue
English
Weight
727 KB
Volume
2
Category
Article
ISSN
0956-5515

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 local search heuristic for unrelated p
A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
✍ N. Piersma; W. van Dijk 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 826 KB

The parallel mechine scheduling problem with unrelated machines is studied where the objective is to minimize the maximum makespan. In this paper, new local search algorithms are proposed where the neighborhood search of a solution uses the "efficiency" of the machinea for each job. It is shown that