Permutation vs. non-permutation flow shop schedules (Q1180831): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Chris N. Potts / rank | |||
Property / author | |||
Property / author: Chris N. Potts / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5759552 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3940839 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3670909 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:51, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Permutation vs. non-permutation flow shop schedules |
scientific article |
Statements
Permutation vs. non-permutation flow shop schedules (English)
0 references
27 June 1992
0 references
approximation algorithms
0 references
flow shop scheduling
0 references
permutation schedules
0 references
maximum completion time
0 references