A block approach for single-machine scheduling with release dates and due dates (Q1083026): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(86)90191-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058004157 / rank | |||
Normal rank | |||
Revision as of 22:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A block approach for single-machine scheduling with release dates and due dates |
scientific article |
Statements
A block approach for single-machine scheduling with release dates and due dates (English)
0 references
1986
0 references
The problem of scheduling deterministic tasks on one machine in order to minimize maximum lateness is considered. Tasks are nonpreemptable. They are characterized by arbitrary processing times, arrival times and deadlines. This problem is known to be NP-hard, thus, unlikely to admit a non-enumerative approach. Hence, in the paper a new method of the branch- and-bound type is proposed. The paper lacks, however, a comparison of the proposed algorithm to other existing methods.
0 references
release dates
0 references
due dates
0 references
scheduling deterministic tasks
0 references
one machine
0 references
maximum lateness
0 references
branch-and-bound
0 references
