Determining the optimal starting times in a cyclic schedule with a given route

DOI10.1016/0305-0548(93)90102-OzbMath0781.90053OpenAlexW2078478455MaRDI QIDQ1310046

Lei Lei

Publication date: 2 January 1994

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

Full work available at URL: https://doi.org/10.1016/0305-0548(93)90102-o

zbMATH Keywords

time-windowscyclic transportation schedulegiven routeoptimal integer starting times

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items

Cyclic scheduling in a robotic production line, Cyclic multiple-robot scheduling with time-window constraints using a critical path approach, A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times, A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule, On-line scheduling in a surface treatment system, Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints, A solution for cyclic scheduling of multi-hoists without overlapping, A parametric critical path problem and an application for cyclic scheduling, Combinatorial optimization models for production scheduling in automated manufacturing systems

Cites Work

• Unnamed Item
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure
• Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
• A Mathematical Model for Periodic Scheduling Problems
• The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints