A hybrid genetic algorithm for parallel machine scheduling with setup times A comparative study of metaheuristics on large problem instances

This paper addresses the unrelated parallel machine scheduling problem with sequence and machine dependent setup times and machine eligibility constraints. The objective is to minimize the maximum completion time (makespan). Instances of more than 500 jobs and 50 machines are not uncommon in industr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of intelligent manufacturing Jg. 33; H. 7; S. 2059 - 2073
1. Verfasser:	Adan, J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.10.2022
Schlagworte:	Business and Management Control Machines Manufacturing Mechatronics Processes Production Robotics Parallel machines Scheduling Makespan Setup times
ISSN:	0956-5515, 1572-8145
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!