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

DOI10.1111/ITOR.13491MaRDI QIDQ6609697FDO

Authors Jens Rocholl, Lars Mönch

Publication date 24 September 2024

Published in International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

decompositiongrouping genetic algorithmiterated local searchdisjunctive graphflow-shop schedulings-batching

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609697)