Minimizing the fleet size with dependent time-window and single-track constraints

DOI10.1016/0167-6377(93)90101-LzbMath0790.90043MaRDI QIDQ1317008

V. Pereyra

Publication date: 23 June 1994

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

heuristic algorithmtime windowcyclic schedulefleet sizesingle-track constraint

Mathematics Subject Classification ID

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

Related Items (6)

A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell ⋮ An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times ⋮ Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm ⋮ A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints ⋮ Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach ⋮ Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots

Cites Work

• A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
• Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
• The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints

This page was built for publication: Minimizing the fleet size with dependent time-window and single-track constraints