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

Lei Lei, Tzyh-Jong Wang

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




Related Items

Mean flow time minimization with given bounds of processing timesA bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraintsCyclic scheduling in a robotic production lineMixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windowsScheduling multiple factory cranes on a common trackA branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lagsAn evolutionary approach for the design and scheduling of electroplating facilitiesOne-dimensional vehicle scheduling with a front-end depot and non-crossing constraintsOptimal cyclic single crane scheduling for two parallel train oilcan repairing linesAn analysis of cyclic scheduling problems in robot centered cellsAn algorithm for hoist scheduling problemsCrane scheduling with time windows in circuit board production linesSingle-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approachA solution for cyclic scheduling of multi-hoists without overlappingAN EFFICIENT OPTIMAL SOLUTION OF A TWO-CRANE SCHEDULING PROBLEMCombinatorial optimization models for production scheduling in automated manufacturing systemsMachine scheduling with an availability constraintDetermining the optimal starting times in a cyclic schedule with a given routeMinimizing the fleet size with dependent time-window and single-track constraints