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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of intelligent manufacturing Ročník 33; číslo 7; s. 2059 - 2073
Hlavný autor:	Adan, J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.10.2022
Predmet:	Business and Management Control Machines Manufacturing Mechatronics Processes Production Robotics Parallel machines Scheduling Makespan Setup times
ISSN:	0956-5515, 1572-8145
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!