Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (Q2448211): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Scheduling incompatible tasks on two machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unknown Input Observers Designed by Eigenstructure Assignment / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the two-stage hybrid flow shop problem with dedicated machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximization problems in single machine scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem / rank | |||
Normal rank | |||
Latest revision as of 11:53, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-dedicated-machine scheduling problem with precedence relations to minimize makespan |
scientific article |
Statements
Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (English)
0 references
30 April 2014
0 references
parallel machine scheduling
0 references
complexity
0 references
assembly line balancing
0 references
0 references
