A genetic algorithm to minimize the makespan in a two-machine cross-docking flow shop problem

DOI10.1007/s40305-019-00277-6zbMath1474.90147OpenAlexW2990469151MaRDI QIDQ2223269

Mohamed Fadhel Tekaya, Imen Hamdi

Publication date: 28 January 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-019-00277-6

zbMATH Keywords

schedulingmakespanflow shopgenetic algorithmcross-docking

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem
• Approximations for the two-machine cross-docking flow shop problem
• Minimizing the makespan in a two-machine cross-docking flow shop problem
• Algorithms for minimizing the makespan in a two-machine cross-docking flow shop problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Truck routing and scheduling for cross-docking in the supply chain: model and solution method
• Crossdocking—JIT scheduling with time windows

This page was built for publication: A genetic algorithm to minimize the makespan in a two-machine cross-docking flow shop problem