Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6654091 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
metaheuristics | |||
| Property / zbMATH Keywords: metaheuristics / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
flow shop | |||
| Property / zbMATH Keywords: flow shop / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
non-permutation schedules | |||
| Property / zbMATH Keywords: non-permutation schedules / rank | |||
Normal rank | |||
Revision as of 07:26, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops |
scientific article |
Statements
Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (English)
0 references
17 November 2016
0 references
scheduling
0 references
metaheuristics
0 references
flow shop
0 references
non-permutation schedules
0 references
