Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time (Q1273118)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time |
scientific article; zbMATH DE number 1229556
| 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; zbMATH DE number 1229556 |
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
