Convex Quadratic Programming in Scheduling

Martin Skutella ()
Additional contact information
Martin Skutella: Technische Universität Berlin, Institut für Mathematik

A chapter in Gems of Combinatorial Optimization and Graph Algorithms, 2015, pp 125-132 from Springer

Abstract: Abstract We consider the optimization problem of scheduling a given set of jobs on unrelated parallel machines with total weighted completion time objective. This is a classical scheduling problem known to be NP-hard since the 1970s. We give a new and simplified version of the currently best-known approximation algorithm, which dates back to 1998. It achieves performance ratio 3 / 2, and is based on an optimal solution to a convex quadratic program.

Keywords: Total Weighted Completion Time; Achieves Performance Ratio; Best-known Approximation Algorithm; Convex Quadratic Programming Relaxation (CQPR); Unrelated Parallel Machine Scheduling Problem (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-24971-1_12

Ordering information: This item can be ordered from
http://www.springer.com/9783319249711

DOI: 10.1007/978-3-319-24971-1_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().