Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems
A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
Variable neighbourhood search: methods and applications
A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem
An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
A hierarchical approach for the FMS scheduling problem
Heuristics for minimizing total weighted tardiness in flexible flow shops
Decomposition methods for reentrant flow shops with sequence-dependent setup times
A batch-oblivious approach for complex job-shop scheduling problems
A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
Bounded serial-batching scheduling for minimizing maximum lateness and makespan
Scheduling with batching: A review
A survey of scheduling with parallel batch (p-batch) processing
The evolution of schematic representations of flow shop scheduling problems
Integrated batch sizing and scheduling on a single machine
A single machine batch scheduling problem with bounded batch size
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Scheduling Groups of Jobs on a Single Machine
Variable neighborhood search: Principles and applications
Learning-augmented heuristics for scheduling parallel serial-batch processing machines

This page was built for publication: Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines