The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
From MaRDI portal
Publication:3989141
DOI10.1287/mnsc.37.12.1629zbMath0741.90036OpenAlexW2102186516MaRDI QIDQ3989141
Publication date: 28 June 1992
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.37.12.1629
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Mean flow time minimization with given bounds of processing times ⋮ A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints ⋮ Cyclic scheduling in a robotic production line ⋮ Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows ⋮ Scheduling multiple factory cranes on a common track ⋮ A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags ⋮ An evolutionary approach for the design and scheduling of electroplating facilities ⋮ One-dimensional vehicle scheduling with a front-end depot and non-crossing constraints ⋮ Optimal cyclic single crane scheduling for two parallel train oilcan repairing lines ⋮ An analysis of cyclic scheduling problems in robot centered cells ⋮ An algorithm for hoist scheduling problems ⋮ Crane scheduling with time windows in circuit board production lines ⋮ Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach ⋮ A solution for cyclic scheduling of multi-hoists without overlapping ⋮ AN EFFICIENT OPTIMAL SOLUTION OF A TWO-CRANE SCHEDULING PROBLEM ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems ⋮ Machine scheduling with an availability constraint ⋮ Determining the optimal starting times in a cyclic schedule with a given route ⋮ Minimizing the fleet size with dependent time-window and single-track constraints
