𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Search heuristics for a parallel machine scheduling problem with ready times and due dates

✍ Scribed by Moon-Won Park; Yeong-Dae Kim

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
348 KB
Volume
33
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

✦ Synopsis

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 problem is to minimize the holding costs of orders including work-in-process as well as finished job inventories. We suggest two local search heuristics, simulated annealing and taboo search algorithms, for the problem Performance of the suggested algorithms is tested through computational experiments on randomly generated test problems.

πŸ“œ 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

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