An efficient new heuristic for the hoist scheduling problem
DOI10.1016/J.COR.2015.10.006zbMATH Open1349.90309OpenAlexW2183641468MaRDI QIDQ342278FDOQ342278
Authors: Adnen El Amraoui, Mohsen Elhafsi 
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
Recommendations
- An algorithm for hoist scheduling problems
- An improved hybrid model for the generic hoist scheduling problem
- An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
- Heuristic for a new multiobjective scheduling problem
- scientific article; zbMATH DE number 1437392
- Robust optimization for the cyclic hoist scheduling problem
- A solution for cyclic scheduling of multi-hoists without overlapping
- Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
- scientific article; zbMATH DE number 1488070
dynamic schedulingheuristicbounded processing timesinitial products sequencemixed integer linear programming (MILP)transportation resources
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)
Cites Work
- A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
- Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
- Robust optimization for the cyclic hoist scheduling problem
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
- Single hoist cyclic scheduling with multiple tanks: A material handling solution
- An algorithm for hoist scheduling problems
- 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
- Crane scheduling with time windows in circuit board production lines
- Control of an electroplating line in the max and min algebras
Cited In (11)
- An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
- Cyclic robot scheduling for 3D printer-based flexible assembly systems
- Integration of routing into a resource-constrained project scheduling problem
- 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
- Scheduling in manufacturing with transportation: classification and solution techniques
- An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
- INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment
- An improved hybrid model for the generic hoist scheduling problem
- Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows
- Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint
This page was built for publication: An efficient new heuristic for the hoist scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342278)
