Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:6546486
Jump to:navigation, search

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)



zbMATH Keywords

iterated greedy algorithmdue windowsno-idle constraintstotal weighted earliness and tardinessdistributed permutation flowshop scheduling


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6546486&oldid=40069920"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 16:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki