The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan (Q1043332): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Open shop scheduling with delays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-machine open shop scheduling with special transportation times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A heuristic for the two-machine open-shop scheduling problem with transportation times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4884350 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line two-machine open shop scheduling with time lags / rank | |||
Normal rank |
Latest revision as of 07:08, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan |
scientific article |
Statements
The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan (English)
0 references
7 December 2009
0 references
makespan
0 references
open-shop
0 references
time delays
0 references
well solvable case
0 references
worst-case analysis
0 references
0 references