Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time (Q1273118): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:45, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time |
scientific article |
Statements
Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time (English)
0 references
7 March 1999
0 references
set-up time
0 references
branch-and-bound
0 references
single-machine scheduling
0 references
batching
0 references
total weighted completion time
0 references
lower bound
0 references
Lagrangian relaxation
0 references
