Robust optimization for the cyclic hoist scheduling problem
From MaRDI portal
Recommendations
- Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints
- A robust basic cyclic scheduling problem
- A branch-and-bound procedure for the robust cyclic job shop problem
- A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints
- A general model for cyclic machine scheduling problems
Cites work
- A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
- A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
- A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
- 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
- An evolutionary approach for the design and scheduling of electroplating facilities
- An improved algorithm for cyclic flowshop scheduling in a robotic cell
- Cyclic hoist scheduling in large real-life electroplating lines
- Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
- Multiobjective optimization. Interactive and evolutionary approaches
- On-line scheduling in a surface treatment system
- One-machine rescheduling heuristics with efficiency and stability as criteria
- Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
- Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions
- Robust scheduling on a single machine to minimize total flow time
- Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
Cited in
(17)- An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
- A solution for cyclic scheduling of multi-hoists without overlapping
- A branch-and-bound procedure for the robust cyclic job shop problem
- 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
- Bi-objective scheduling on uniform parallel machines considering electricity cost
- An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
- Grouping tasks to save energy in a cyclic scheduling problem: a complexity study
- Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants
- A dynamic scheduling approach for optimizing the material handling operations in a robotic cell
- The robust cyclic job shop problem
- Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows
- A robust basic cyclic scheduling problem
- Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions
- An improved hybrid model for the generic hoist scheduling problem
- An efficient bicriteria algorithm for stable robotic flow shop scheduling
This page was built for publication: Robust optimization for the cyclic hoist scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300031)
