Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping
From MaRDI portal
Publication:2669726
Recommendations
- Modeling realistic hybrid flexible flowshop scheduling problems
- Flexible job-shop scheduling problem under resource constraints
- Flow Shop Scheduling with Resource Flexibility
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- Linear programming \& metaheuristic approach for scheduling in the hybrid flowshop with resource constraints
Cites work
- A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: trade-off between production costs and energy consumption
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
- A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints
- Parallel machine scheduling with additional resources: a Lagrangian-based constraint programming approach
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
Cited in
(4)- Patients transportation in surgery scheduling problem
- A systematic review of multi-objective hybrid flow shop scheduling
- Job-shop scheduling with limited flexible workers considering ergonomic factors using an improved multi-objective discrete Jaya algorithm
- Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines
This page was built for publication: Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669726)