An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
From MaRDI portal
Publication:5322091
DOI10.1287/OPRE.1040.0167zbMATH Open1165.90462OpenAlexW2136502128MaRDI QIDQ5322091FDOQ5322091
Publication date: 18 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/38307
Recommendations
- An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
- A solution for cyclic scheduling of multi-hoists without overlapping
- Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times
- Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
- The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
- Robust optimization for the cyclic hoist scheduling problem
- Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions
- An efficient new heuristic for the hoist scheduling problem
- Predicting the optimal period for Cyclic Hoist Scheduling Problems
Cited In (22)
- Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions
- An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
- Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions
- Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach
- Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
- Two job cyclic scheduling with incompatibility constraints
- Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times
- AN EFFICIENT OPTIMAL SOLUTION OF A TWO-CRANE SCHEDULING PROBLEM
- The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
- An evolutionary approach for the design and scheduling of electroplating facilities
- Scheduling of a single crane in batch annealing process
- A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
- A solution for cyclic scheduling of multi-hoists without overlapping
- Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization
- Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance
- Optimising the slab yard planning and crane scheduling problem using a two-stage heuristic
- Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
- Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading
- Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
- Cyclic hoist scheduling in large real-life electroplating lines
- A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
- Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows
This page was built for publication: An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322091)