A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization

DOI10.1007/978-3-319-89920-6_77zbMath1397.90182OpenAlexW2804942412WikidataQ57633748 ScholiaQ57633748MaRDI QIDQ4685816

Julia Lange, Frank Werner

Publication date: 9 October 2018

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_77

zbMATH Keywords

simulated annealingblockingjob-shop scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
• A new neighborhood and tabu search for the blocking job shop
• Scheduling trains as a blocking parallel-machine job shop scheduling problem
• Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
• Job-shop scheduling with blocking and no-wait constraints
• A branch and bound algorithm for scheduling trains in a railway network
• A neighborhood for complex job shop scheduling problems with regular objectives

This page was built for publication: A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization