Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5349734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date |
scientific article; zbMATH DE number 5349734 |
Statements
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (English)
0 references
8 October 2008
0 references
scheduling
0 references
earliness and tardiness
0 references
common due date
0 references
flowshop
0 references
heuristics
0 references
0 references
0 references
0 references
0 references
0.94831264
0 references
0.91124624
0 references
0.9093133
0 references
0.9078166
0 references
0.90408516
0 references
0.90112025
0 references
0.8944529
0 references
0.8916154
0 references
0.8897966
0 references
