Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows
From MaRDI portal
Publication:5058816
DOI10.1080/0305215X.2017.1418865OpenAlexW2791089466MaRDI QIDQ5058816
Qiuhua Tang, Zixiang Li, Yong-Nian Mao, Li-Ping Zhang
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2017.1418865
Cites Work
- Robust optimization for the cyclic hoist scheduling problem
- Scheduling multiple factory cranes on a common track
- An efficient new heuristic for the hoist scheduling problem
- Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance
- A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints
- Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
- A parametric critical path problem and an application for cyclic scheduling
- Stochastic simulations of two-dimensional composite packings
- Single hoist cyclic scheduling with multiple tanks: A material handling solution
- A solution for cyclic scheduling of multi-hoists without overlapping
- The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
- 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
- An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
- Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints
This page was built for publication: Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows