The distributed no-idle permutation flowshop scheduling problem with due windows
From MaRDI portal
Publication:6546486
DOI10.1007/s40314-024-02702-wMaRDI QIDQ6546486
Kasra Mousighichi, Mualla Gonca Avci
Publication date: 29 May 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
iterated greedy algorithmdue windowsno-idle constraintstotal weighted earliness and tardinessdistributed permutation flowshop scheduling
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
This page was built for publication: The distributed no-idle permutation flowshop scheduling problem with due windows