𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ordinal algorithms for parallel machine scheduling

✍ Scribed by Wei-Ping Liu; Jeffrey B. Sidney; André van Vliet

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
458 KB
Volume
18
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel machine scheduling problems usi
Parallel machine scheduling problems using memetic algorithms
✍ Runwei Cheng; Mitsuo Gen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 309 KB

In this paper, we investigate how to apply the hybrid genetic algorithms (the memeti¢ algorithms) to solve the parallel machine scheduling problem. There are two essential issues to be dealt with for all kinds of parallel machine scheduling problems: job partition among machines and job sequence wit

Exact and heuristic algorithms for paral
Exact and heuristic algorithms for parallel-machine scheduling with DeJong’s learning effect
✍ Dariusz Okołowski; Stanisław Gawiejnowicz 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 296 KB

## a b s t r a c t We consider a parallel-machine scheduling problem with a learning effect and the makespan objective. The impact of the learning effect on job processing times is modelled by the general DeJong's learning curve. For this NP-hard problem we propose two exact algorithms: a sequenti

Exact algorithms for scheduling multiple
Exact algorithms for scheduling multiple families of jobs on parallel machines
✍ Zhi-Long Chen; Warren B. Powell 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o