Robust optimization for the cyclic hoist scheduling problem
From MaRDI portal
Publication:300031
DOI10.1016/j.ejor.2014.06.047zbMath1338.90163OpenAlexW2054492678WikidataQ57185582 ScholiaQ57185582MaRDI QIDQ300031
Jianguang Feng, Haoxun Chen, Chengbin Chu, Ada Che
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.06.047
Related Items (11)
Bi-objective scheduling on uniform parallel machines considering electricity cost ⋮ Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows ⋮ An efficient new heuristic for the hoist scheduling problem ⋮ Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization ⋮ Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance ⋮ A dynamic scheduling approach for optimizing the material handling operations in a robotic cell ⋮ Grouping tasks to save energy in a cyclic scheduling problem: a complexity study ⋮ The robust cyclic job shop problem ⋮ A robust basic cyclic scheduling problem ⋮ An efficient bicriteria algorithm for stable robotic flow shop scheduling ⋮ Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants
Uses Software
Cites Work
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
- An evolutionary approach for the design and scheduling of electroplating facilities
- Multiobjective optimization. Interactive and evolutionary approaches
- One-machine rescheduling heuristics with efficiency and stability as criteria
- An improved algorithm for cyclic flowshop scheduling in a robotic cell
- A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- Robust scheduling on a single machine to minimize total flow time
- A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
- On-line scheduling in a surface treatment system
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
- Cyclic hoist scheduling in large real-life electroplating lines
- A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
- 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
This page was built for publication: Robust optimization for the cyclic hoist scheduling problem
