New results in the worst-case analysis of approximation algorithms for scheduling problems
Conference
·
OSTI ID:36084
In this paper we provide a review of recent results in the worst-cast analysis of approximation algorithms formulated for scheduling problems. Chiefly, tight evaluations of the worst-case performance ratio of nine (known from the literature) approximation algorithm for the flop shop problem are provided. There are considered equally constructive algorithms and those based on the local neighborhood search. Moreover, a new 3/2 approximation algorithm with O(nlog n) computational complexity for the single-machine scheduling problem with release times and delivery times is shown. Some conclusions obtained from the analysis are also discussed.
- OSTI ID:
- 36084
- Report Number(s):
- CONF-9408161-; TRN: 94:009753-0356
- Resource Relation:
- Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Improved approximation algorithms for scheduling with release dates
Some problems in sequencing and scheduling utilizing branch and bound algorithms
Algorithms for scheduling and network problems. Doctoral thesis
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:36084
Some problems in sequencing and scheduling utilizing branch and bound algorithms
Thesis/Dissertation
·
Fri Jan 01 00:00:00 EST 1988
·
OSTI ID:36084
Algorithms for scheduling and network problems. Doctoral thesis
Technical Report
·
Sun Sep 01 00:00:00 EDT 1991
·
OSTI ID:36084