A New Heuristic Method for the Permutation Flow Shop Scheduling Problem (Q4849303): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1057/jors.1995.119 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1057/JORS.1995.119 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:17, 30 December 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
