A block approach for single-machine scheduling with release dates and due dates (Q1083026): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Jozef Grabowski / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Jacek Błażewicz / rank | |||
Normal rank |
Revision as of 08:12, 11 February 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