Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem

Cites Work

Unnamed Item
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Some efficient heuristic methods for the flow shop sequencing problem
The distributed permutation flowshop scheduling problem
Scheduling a flowline manufacturing cell with sequence dependent family setup times
No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
Heuristics for no-wait flowshops with makespan subject to mean completion time
Metaheuristic algorithms for the hybrid flowshop scheduling problem
No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant

This page was built for publication: Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem