Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
A solution procedure is developed for the Engine Scheduling Problem (ESP) which appears in connection with rail freight transport systems. Different mixed integer linear programming formulations for the ESP are discussed. The most promising approach, based on a set partitioning formulation, is implemented. To solve the set partitioning problem a price-and-branch approach is used. Lower bounds are derived by solving the continuous relaxation of the set partitioning problem with column generation techniques. Computational results for problem instances based on real world data are reported. It is possible to solve instances with 35 transportation requests to be served by six engines.
- A branch-cut-and-price algorithm for optimal decoding in digital communication systems
- On the exact separation of cover inequalities of maximum-depth
- Freight railway operator timetabling and engine scheduling
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage
- Hybrid column generation for large-size covering integer programs: application to transportation planning
- scientific article; zbMATH DE number 2042676 (Why is no real title available?)
- Dual variable based fathoming in dynamic programs for column generation
- Integrated airline scheduling
This page was built for publication: Engine scheduling by column generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2740904)
