A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
From MaRDI portal
Publication:1341993
DOI10.1016/0377-2217(94)90127-9zbMath0813.90057OpenAlexW2083808640MaRDI QIDQ1341993
Publication date: 11 January 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90127-9
Related Items (13)
Optimal \(K\)-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times ⋮ A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows ⋮ Robust optimization for the cyclic hoist scheduling problem ⋮ Scheduling multiple factory cranes on a common track ⋮ Converging to periodic schedules for cyclic scheduling problems with resources and deadlines ⋮ An efficient new heuristic for the hoist scheduling problem ⋮ A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags ⋮ A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule ⋮ Steady state analysis of timed event graphs with time window constraints ⋮ Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints ⋮ An improved algorithm for cyclic flowshop scheduling in a robotic cell ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems ⋮ Minimizing the fleet size with dependent time-window and single-track constraints
Cites Work
This page was built for publication: A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
