Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints

In this paper we investigate the problem of scheduling a set of jobs on a single-machine. The jobs are classified in families and setup times are required between the processing of two jobs of different families. Each job requires a certain amount of a common resource that is supplied through upstre...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of mathematics and artificial intelligence Jg. 88; H. 1-3; S. 169 - 185
Hauptverfasser:	Pinheiro, Júlio C. S. N., Arroyo, José Elias C.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cham Springer International Publishing 01.03.2020 Springer Springer Nature B.V
Schlagworte:	Artificial Intelligence Complex Systems Computer Science Heuristic Mathematics Operators Scheduling Statistical tests Resource constraints Family setup-times 90B35 90C59 90C27 Single machine scheduling Total tardiness Meta-heuristics
ISSN:	1012-2443, 1573-7470
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!