FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors (Q4718639): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Branch and bound algorithm for the flow shop with multiple processors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Two-Stage Flowshop Scheduling Problem with M Machines at each Stage / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines / rank | |||
Normal rank |
Latest revision as of 15:08, 24 May 2024
scientific article; zbMATH DE number 954588
Language | Label | Description | Also known as |
---|---|---|---|
English | FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors |
scientific article; zbMATH DE number 954588 |
Statements
FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors (English)
0 references
12 May 1997
0 references
minimum makespan
0 references
flow shop
0 references
multiple processors
0 references
0 references