𝔖 Bobbio Scriptorium
✦   LIBER   ✦

VARIABLE NEIGHBORHOOD DESCENT FOR THE UNRELATED PARALLEL MACHINE SCHEDULING PROBLEM

✍ Scribed by CHARALAMBOUS, CHRISTOFOROS; FLESZAR, KRZYSZTOF

Book ID
120536093
Publisher
World Scientific Publishing Company
Year
2012
Tongue
English
Weight
286 KB
Volume
21
Category
Article
ISSN
1793-6349

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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