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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of intelligent manufacturing Vol. 33; no. 7; pp. 2059 - 2073
Main Author:	Adan, J.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2022
Subjects:	Business and Management Control Machines Manufacturing Mechatronics Processes Production Robotics Parallel machines Scheduling Makespan Setup times
ISSN:	0956-5515, 1572-8145
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!