Lower bounds for parallel machine scheduling problems (Q947338)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for parallel machine scheduling problems |
scientific article |
Statements
Lower bounds for parallel machine scheduling problems (English)
0 references
2 October 2008
0 references
Summary: We study the parallel machine scheduling problem with release dates and consider several `min-sum' objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to compare these lower bounds according to their quality and of their computational time requirement.
0 references
identical parallel machines
0 references
lower bounds
0 references
parallel machine scheduling
0 references
total cost
0 references
release dates
0 references
