A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting

DOI10.1016/j.cor.2023.106222OpenAlexW4360874227MaRDI QIDQ6164605

Tugba Saraç, Busra Tutumlu

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106222

zbMATH Keywords

mixed integer programminglocal search algorithmhybrid genetic algorithmflexible job shop scheduling problemjob-splitting

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Job-shop scheduling with multi-purpose machines
• Scheduling with job-splitting considering learning and the vital-few law
• Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
• A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem
• A research survey: review of flexible job shop scheduling techniques
• The Complexity of Flowshop and Jobshop Scheduling
• A demonstration of the utility of fractional experimental design for finding optimal genetic algorithm parameter settings
• Flow Shop Lot Streaming
• Scheduling in a flexible job shop followed by some parallel assembly stations considering lot streaming

This page was built for publication: A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting