A noncompact formulation for job-shop scheduling problems in traffic management

DOI10.1287/OPRE.2018.1837MaRDI QIDQ5129213zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

algorithmsBenders' decompositioninteger programmingschedulingtransportation technology

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Mixed integer programming (90C11)

Recommendations

• Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
• Mixed integer programming models for job shop scheduling: A computational analysis
• MILP formulations of cumulative constraints for railway scheduling -- a comparative study
• A time-indexed LP-based approach for min-sum job-shop problems
• Mixed binary integer programming formulations for the reentrant job shop scheduling problem

Cites work

• An exact decomposition approach for the real-time train dispatching problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Disjunctive Programming
• Facets of the knapsack polytope
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Job-shop scheduling with blocking and no-wait constraints
• Lifting the facets of zero–one polytopes
• Linear optimization and extensions. Problems and solutions
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Nominal and robust train timetabling problems
• On mathematical programming with indicator constraints
• Optimal real-time traffic control in metro stations
• Scheduling. Theory, algorithms, and systems.
• The 0-1 knapsack problem with a single continuous variable
• Timing problems and algorithms: time decisions for sequences of activities
• Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling

Cited in

(5)

• Air traffic flow management with layered workload constraints
• Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events
• Easy cases of deadlock detection in train scheduling
• An optimization-based decision support tool for incremental train timetabling
• A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems

This page was built for publication: A noncompact formulation for job-shop scheduling problems in traffic management

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129213)