scientific article; zbMATH DE number 1187167

MaRDI QIDQ3840374zbMATH OpenFDO

Authors R. N. Uma, Joel Wein

Publication date 10 August 1998

zbMATH Keywords

average weighted completion timelower bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
• An experimental study of LP-based approximation algorithms for scheduling problems
• Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
• Parallel machine scheduling by column generation
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

Cited in

(7)

• Off-line admission control for general scheduling problems
• Designing PTASs for MIN-SUM scheduling problems
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
• On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
• Strategies for LP-based solving a general class of scheduling problems
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

Describes a project that uses

Uses Software

• QAPLIB
• ABACUS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840374)