A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities (Q3423262): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (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.1002/nav.20118 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027408354 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4023843 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4254875 / rank | |||
Normal rank | |||
Latest revision as of 15:08, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities |
scientific article |
Statements
A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities (English)
0 references
20 February 2007
0 references
parallel machine scheduling
0 references
time windows
0 references
branch and price
0 references
GRASP
0 references
job priorities
0 references
