Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows |
scientific article; zbMATH DE number 6901357
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows |
scientific article; zbMATH DE number 6901357 |
Statements
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (English)
0 references
11 July 2018
0 references
hybrid flowshop
0 references
due date window
0 references
heuristics
0 references
iterated local search
0 references
iterated greedy
0 references
0 references
0 references
0 references
0 references
0 references
