Approaches to modeling train scheduling problems as job-shop problems with blocking constraints

DOI10.1007/s10951-017-0526-0zbMath1392.90062OpenAlexW2607795493WikidataQ57633757 ScholiaQ57633757MaRDI QIDQ1743650

Julia Lange, Frank Werner

Publication date: 13 April 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-017-0526-0

zbMATH Keywords

mixed integer programmingblockingjob-shoptotal tardinesstrain scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ The single train shortest route problem in a railyard ⋮ Efficient primal heuristic updates for the blocking job shop problem ⋮ A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization ⋮ Preface ⋮ Scheduling for multi-robot routing with blocking and enabling constraints ⋮ Multiple train repositioning operations in a railyard network ⋮ Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing

Cites Work

• A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
• Railway track allocation: Models and methods
• A new neighborhood and tabu search for the blocking job shop
• Scheduling trains as a blocking parallel-machine job shop scheduling problem
• A fast heuristic for the train scheduling problem
• Job-shop scheduling with blocking and no-wait constraints
• A branch and bound algorithm for scheduling trains in a railway network
• A disjunctive graph model and framework for constructing new train schedules
• Heuristic techniques for single line train scheduling
• A Survey of Optimization Models for Train Routing and Scheduling
• A study of integer programming formulations for scheduling problems
• A Model, Algorithms and Strategy for Train Pathing

This page was built for publication: Approaches to modeling train scheduling problems as job-shop problems with blocking constraints