Scheduling two parallel machines with a single server: the general case (Q2571191): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complexity results for parallel machine problems with a single server / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling parallel machines with a single server: Some solvable cases and heuristics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling two parallel semiautomatic machines to minimize machine interference / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equal processing and equal setup time cases of scheduling parallel machines with a single server / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank | |||
Normal rank | |||
Latest revision as of 10:02, 11 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling two parallel machines with a single server: the general case |
scientific article |
Statements
Scheduling two parallel machines with a single server: the general case (English)
0 references
1 November 2005
0 references
parallel machines
0 references
single server
0 references
setup
0 references
0 references
