Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping
From MaRDI portal
Publication:2669726
DOI10.1016/J.COR.2021.105625OpenAlexW3212661937MaRDI QIDQ2669726
Seyed Mohammad Hassan Hosseini, Ali Hasani
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105625
Related Items (1)
Cites Work
- A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
- 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
- Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: trade-off between production costs and energy consumption
- Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming Approach
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
This page was built for publication: Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping
