Scheduling with release dates on a single machine to minimize total weighted completion time (Q1193720)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling with release dates on a single machine to minimize total weighted completion time |
scientific article |
Statements
Scheduling with release dates on a single machine to minimize total weighted completion time (English)
0 references
27 September 1992
0 references
The problem to be considered is one of scheduling nonpreemptable, independent tasks on one machine subject to non-equal ready times. The objective is to find a schedule with a minimum value of mean weighted flow time. Since the problem is known to be NP-hard, the authors propose a new branch-and-bound algorithm for solving it. Its efficiency is improved by new branching and dominance rules.
0 references
nonpreemptable, independent tasks
0 references
one machine
0 references
non-equal ready times
0 references
NP-hard
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
