Applying Column Generation to Machine Scheduling

Marjan Akker (), Han Hoogeveen () and Steef Velde ()
Additional contact information
Marjan Akker: Utrecht University
Han Hoogeveen: Utrecht University
Steef Velde: Erasmus University

Chapter Chapter 11 in Column Generation, 2005, pp 303-330 from Springer

Abstract: Abstract The goal of a scheduling problem is to find out when each task must be performed and by which machine such that an optimal solution is obtained. Especially when the main problem is to divide the jobs over the machines, column generation turns out to be very successful. Next to a number of these ‘partitioning’ problems, we shall discuss a number of other problems that have successfully been tackled by a column generation approach.

Keywords: Schedule Problem; Completion Time; Linear Programming Relaxation; Price Problem; Partial Schedule (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (3)

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-0-387-25486-9_11

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

DOI: 10.1007/0-387-25486-2_11

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 ().