Minimizing makespan for two parallel machines with job limit on each availability interval (Q5428993): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/palgrave.jors.2602209 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009115040 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:58, 19 March 2024
scientific article; zbMATH DE number 5215853
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing makespan for two parallel machines with job limit on each availability interval |
scientific article; zbMATH DE number 5215853 |
Statements
Minimizing makespan for two parallel machines with job limit on each availability interval (English)
0 references
29 November 2007
0 references
scheduling
0 references
parallel machines
0 references
availability constraint
0 references
makespan
0 references
branch and bound method
0 references
