The distributed no-idle permutation flowshop scheduling problem with due windows

DOI10.1007/S40314-024-02702-WMaRDI QIDQ6546486zbMATH OpenFDO

Authors Kasra Mousighichi, Mualla Gonca Avci

Publication date 29 May 2024

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S40314-024-02702-W

zbMATH Keywords

distributed permutation flowshop schedulingdue windowsiterated greedy algorithmno-idle constraintstotal weighted earliness and tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups
• No-wait flexible flow shop scheduling with due windows
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
• An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times

Cites work

• A branch-and-cut approach for the distributed no-wait flowshop scheduling problem
• A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• A review and classification on distributed permutation flowshop scheduling problems
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel flowshop scheduling using Tabu search
• Tabu Search—Part I
• Tabu Search—Part II
• The distributed permutation flowshop scheduling problem

This page was built for publication: The distributed no-idle permutation flowshop scheduling problem with due windows

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