✦ LIBER ✦

Search tree based approaches for parallel machine scheduling

✍ Scribed by Emmanuel Néron; Fabrice Tercinet; Francis Sourd

Book ID: 108105781
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 193 KB
Volume: 35
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2006.07.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling jobs on parallel machines: a

Scheduling jobs on parallel machines: a restricted tabu search approach

✍ ChangOuk Kim; HyunJoon Shin 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 442 KB

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

Solution approaches for a real-life reso

Solution approaches for a real-life resource-constrained parallel machine scheduling problem

✍ Emrah B. Edis; Irem Ozkarahan 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 272 KB

A search heuristic for just-in-time sche

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

✍ Manuel Laguna; José Luis González Velarde 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 727 KB

Coordination mechanisms for parallel mac

Coordination mechanisms for parallel machine scheduling

✍ Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Ordinal algorithms for parallel machine

Ordinal algorithms for parallel machine scheduling

✍ Wei-Ping Liu; Jeffrey B. Sidney; André van Vliet 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 458 KB