Design of scheduling algorithms : applications - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2010

Design of scheduling algorithms : applications

Résumé

This chapter discusses the insights developed for designing scheduling algorithms according to three design projects where algorithms have been developed. The choice of applications covers a broad spectrum. The methods used are from three different fields, namely combinatorial optimization, genetic (evolutionary) algorithms, and mathematical optimization. The application areas differ also in terms of the role of a human user of the algorithm. The three application areas are: 1. Decision support for shunting yard scheduling using a network flow heuristic; 2. An evolutionary multi-objective decision tool for job-shop scheduling; 3. Group sequencing: a predictive-reactive scheduling method for job-shop scheduling.

Domaines

Psychologie
Fichier non déposé

Dates et versions

hal-00521393 , version 1 (27-09-2010)

Identifiants

  • HAL Id : hal-00521393 , version 1

Citer

Riezebos Jan, Jean-Michel Hoc, Mebarki Nasser, Christos Dimopoulos, Wezel Wout Van, et al.. Design of scheduling algorithms : applications. J.C. Fransoo, T. Wäfler, & J.R. Wilson. Behavioral operations in planning and scheduling, Springer, pp.371-412, 2010. ⟨hal-00521393⟩
226 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More