A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:55, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times |
scientific article |
Statements
A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (English)
0 references
22 December 2009
0 references
scheduling problems
0 references
parallel machines
0 references
Lagrangean relaxation
0 references
relax-and-cut
0 references
