Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping
From MaRDI portal
Publication:5059417
DOI10.1080/0305215X.2019.1674295OpenAlexW2980432255WikidataQ127017627 ScholiaQ127017627MaRDI QIDQ5059417
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2019.1674295
sequence-dependent setup timesdistributed schedulingshuffled frog-leaping algorithmtwo-stage hybrid flowshop scheduling problem
Related Items (4)
Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem ⋮ Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups ⋮ A systematic review of multi-objective hybrid flow shop scheduling ⋮ Improved shuffled frog leaping algorithm with unsupervised population partitioning strategies for complex optimization problems
Cites Work
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation
- A heuristic method for two-stage hybrid flow shop with dedicated machines
- A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem
- An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
- Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times
- An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem
- The hybrid flow shop scheduling problem
- A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
- Scheduling two-stage hybrid flow shop with availability constraints
- The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine
- Order Assignment and Scheduling in a Supply Chain
- Auction-based approach for a flexible job-shop scheduling problem with multiple process plans
This page was built for publication: Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping