Minimizing the maximal weighted lateness of delivering orders between two railroad stations

DOI10.1134/S0005117916120018MaRDI QIDQ517328zbMATH OpenFDO

Authors Alexander A. Lazarev, Dmitry I. Arkhipov

Publication date 23 March 2017

Published in Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of optimal control and differential games (49N90) Transportation, logistics and supply chain management (90B06)

Recommendations

• Minimizing delays in a shunting yard
• On one approach to constructing timetables of freight trains in a railroad network
• Scheduling Trains and Containers with Due Dates and Dynamic Arrivals
• scientific article; zbMATH DE number 834590
• Minimizing the total weighted delivery time in container transportation scheduling

Cites work

• A survey of optimization models for train routing and scheduling
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling bidirectional traffic on a path
• Scheduling railway traffic at a construction site

Cited in

(3)

• On the general problem statement of cargo carriages scheduling and ways to solve it
• Minimizing delays in a shunting yard
• Scheduling Trains and Containers with Due Dates and Dynamic Arrivals

This page was built for publication: Minimizing the maximal weighted lateness of delivering orders between two railroad stations

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