A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management
From MaRDI portal
Publication:5129213
DOI10.1287/opre.2018.1837zbMath1444.90037OpenAlexW2974067259WikidataQ127252035 ScholiaQ127252035MaRDI QIDQ5129213
Leonardo Lamorgese, Carlo Mannino
Publication date: 26 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://urn.nb.no/URN:NBN:no-78029
Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)
Related Items (5)
Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events ⋮ An optimization-based decision support tool for incremental train timetabling ⋮ Easy Cases of Deadlock Detection in Train Scheduling ⋮ A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems ⋮ Air traffic flow management with layered workload constraints
Cites Work
- Unnamed Item
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- The 0-1 knapsack problem with a single continuous variable
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
- Job-shop scheduling with blocking and no-wait constraints
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Nominal and robust train timetabling problems
- On mathematical programming with indicator constraints
- Optimal Real-Time Traffic Control in Metro Stations
- An Exact Decomposition Approach for the Real-Time Train Dispatching Problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Lifting the facets of zero–one polytopes
- Facets of the knapsack polytope
- Disjunctive Programming
- Timing problems and algorithms: Time decisions for sequences of activities
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Scheduling
- Linear optimization and extensions. Problems and solutions
This page was built for publication: A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management
