๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Heuristics for unrelated machine scheduling with precedence constraints

โœ Scribed by Jeffrey Herrmann; Jean-Marie Proth; Nathalie Sauer

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
612 KB
Volume
102
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Single machine scheduling with decreasin
Single machine scheduling with decreasing linear deterioration under precedence constraints
โœ Ji-Bo Wang ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 538 KB

This paper deals with single-machine scheduling problems with decreasing linear deterioration, i.e., jobs whose processing times are a decreasing function of their starting times. In addition, the jobs are related by parallel chains and a series-parallel graph precedence constraints, respectively. I

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