Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073): 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: 6654041 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
flowshop | |||
| Property / zbMATH Keywords: flowshop / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
heuristics | |||
| Property / zbMATH Keywords: heuristics / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
neh | |||
| Property / zbMATH Keywords: neh / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
pfsp | |||
| Property / zbMATH Keywords: pfsp / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum tardiness | |||
| Property / zbMATH Keywords: maximum tardiness / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
makespan | |||
| Property / zbMATH Keywords: makespan / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bounded insertion | |||
| Property / zbMATH Keywords: bounded insertion / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
non-population algorithm | |||
| Property / zbMATH Keywords: non-population algorithm / rank | |||
Normal rank | |||
Revision as of 06:25, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness |
scientific article |
Statements
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (English)
0 references
17 November 2016
0 references
scheduling
0 references
flowshop
0 references
heuristics
0 references
neh
0 references
pfsp
0 references
maximum tardiness
0 references
makespan
0 references
bounded insertion
0 references
non-population algorithm
0 references
