Scheduling trains as a blocking parallel-machine job shop scheduling problem

DOI10.1016/j.cor.2008.12.012zbMath1160.90476OpenAlexW1967184557MaRDI QIDQ1017462

Shi Qiang Liu, Erhan Kozan

Publication date: 19 May 2009

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

Full work available at URL: https://eprints.qut.edu.au/29818/1/Computers_and_Operations_Research__Scheduling_trains_as_a_blocking_parallel_machine_job_shop_scheduling_problem_.pdf

zbMATH Keywords

job shop schedulingparallel machineblockingtrain scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems ⋮ Optimisation models for expanding a railway's theoretical capacity ⋮ Determining operations affected by delay in predictive train timetables ⋮ A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations ⋮ A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ An optimization-based decision support tool for incremental train timetabling ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Job-Shop Scheduling with Mixed Blocking Constraints between Operations ⋮ Mathematical model applied to single-track line scheduling problem in Brazilian railways ⋮ Optimization of multiperiod mixed train schedule on high-speed railway ⋮ Optimising a coal rail network under capacity constraints ⋮ A job-shop scheduling approach for optimising sugarcane rail operations ⋮ Approaches to modeling train scheduling problems as job-shop problems with blocking constraints ⋮ Efficient primal heuristic updates for the blocking job shop problem ⋮ Timetable coordination in a rail transit network with time-dependent passenger demand ⋮ A new constraint programming approach for optimising a coal rail system ⋮ A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization ⋮ A simulated annealing algorithm for first train transfer problem in urban railway networks ⋮ A heuristic approach to solving the train traffic re-scheduling problem in real time ⋮ Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing

Cites Work

• Unnamed Item
• Looking ahead with the pilot method
• The one-machine sequencing problem
• An optimization based approach to the train operator scheduling problem at Singapore MRT
• Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem
• Job-shop scheduling with blocking and no-wait constraints
• Cost optimal periodic train scheduling
• A fast tabu search algorithm for the group shop scheduling problem
• Bicriteria train scheduling for high-speed passenger railroad planning applications
• Heuristic techniques for single line train scheduling
• Rollout algorithms for combinatorial optimization
• Modeling Train Delays in Urban Networks
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
• A Genetic Algorithm for Railway Scheduling Problems