The distributed no-idle permutation flowshop scheduling problem with due windows
type: Item
instance of: scholarly article
title: The distributed no-idle permutation flowshop scheduling problem with due windows
author: Kasra Mousighichi
author: Mualla Gonca Avci
published in: Computational and Applied Mathematics
publication date: 2024-05-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7855888
zbMATH Keywords: distributed permutation flowshop scheduling
zbMATH Keywords: no-idle constraints
zbMATH Keywords: due windows
zbMATH Keywords: total weighted earliness and tardiness
zbMATH Keywords: iterated greedy algorithm
MaRDI profile type: Publication
cites work: A branch-and-cut approach for the distributed no-wait flowshop scheduling problem
cites work: Parallel flowshop scheduling using Tabu search
cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4124332
cites work: The distributed permutation flowshop scheduling problem
cites work: A scatter search algorithm for the distributed permutation flowshop scheduling problem
cites work: Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
cites work: A review and classification on distributed permutation flowshop scheduling problems
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
DOI: 10.1007/S40314-024-02702-W
description: scientific article; zbMATH DE number 7855888