𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search

✍ Scribed by N. Piersma; W. van Dijk

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
826 KB
Volume
24
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

✦ Synopsis

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 this method yields better solutions and shorter running times than the more general local search heuristics.

πŸ“œ 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 multilevel variable neighborhood searc
A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem
✍ Min Wen; Emil Krapper; Jesper Larsen; Thomas K. Stidsen πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 311 KB

## Abstract The world's second largest producer of pork, Danish Crown, also provides a fresh meat supply logistics system within Denmark. This is used by the majority of supermarkets in Denmark. This article addresses an integrated vehicle routing and driver scheduling problem arising at Danish Cro

A note on β€œBeam search heuristics for th
A note on β€œBeam search heuristics for the single machine early/tardy scheduling problem with no machine idle time”
✍ F. Della Croce; E. Desmier; T. Garaix πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 171 KB

In a recent paper by Valente ''Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time" ', Computers & Industrial Engineering, 55, 663-675, 2008, several beam search approaches are compared on a large set of instances of the total weighted earlinesstard

Genetic algorithms for the job-shop sche
Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence
✍ Fatima Ghedjati πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 360 KB

In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (Cmax). We propose an