An efficient new heuristic for the hoist scheduling problem
From MaRDI portal
Publication:342278
DOI10.1016/j.cor.2015.10.006zbMath1349.90309OpenAlexW2183641468MaRDI QIDQ342278
Mohsen Elhafsi, Adnen El Amraoui
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.10.006
heuristicdynamic schedulingbounded processing timesinitial products sequencemixed integer linear programming (MILP)transportation resources
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Cyclic robot scheduling for 3D printer-based flexible assembly systems ⋮ Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows ⋮ Integration of routing into a resource-constrained project scheduling problem ⋮ Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint
Cites Work
- Robust optimization for the cyclic hoist scheduling problem
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
- A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
- Single hoist cyclic scheduling with multiple tanks: A material handling solution
- Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times
- The relationship between the physical layout of the work stations and the productivity of a saturated single-hoist production line
- An algorithm for hoist scheduling problems
- Crane scheduling with time windows in circuit board production lines
- Control of an electroplating line in the max and min algebras
- Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
This page was built for publication: An efficient new heuristic for the hoist scheduling problem
