An efficient new heuristic for the hoist scheduling problem

DOI10.1016/J.COR.2015.10.006MaRDI QIDQ342278zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dynamic schedulingheuristicbounded processing timesinitial products sequencemixed integer linear programming (MILP)transportation resources

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

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

Cites work

• A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
• An algorithm for hoist scheduling problems
• Control of an electroplating line in the max and min algebras
• Crane scheduling with time windows in circuit board production lines
• Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
• Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times
• Robust optimization for the cyclic hoist scheduling problem
• Single hoist cyclic scheduling with multiple tanks: A material handling solution
• The relationship between the physical layout of the work stations and the productivity of a saturated single-hoist production line
• Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance

Cited in

(11)

• Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint
• Cyclic robot scheduling for 3D printer-based flexible assembly systems
• An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
• 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
• An improved hybrid model for the generic hoist scheduling problem
• INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment
• Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows

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)