A New Heuristic Method for the Permutation Flow Shop Scheduling Problem (Q4849303): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/jors.1995.119 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2123411720 / rank | |||
Normal rank | |||
Latest revision as of 20:08, 19 March 2024
scientific article; zbMATH DE number 800668
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A New Heuristic Method for the Permutation Flow Shop Scheduling Problem |
scientific article; zbMATH DE number 800668 |
Statements
A New Heuristic Method for the Permutation Flow Shop Scheduling Problem (English)
0 references
5 March 1996
0 references
sequencing
0 references
tabu search
0 references
travelling salesman
0 references
heuristic
0 references
permutation flow shop scheduling
0 references
