Applying column generation to machine scheduling

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

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.

Original languageEnglish
Title of host publicationColumn Generation
EditorsG. Desaulniers, J. Desrosiers, M.M. Solomon
Place of PublicationNew York
PublisherSpringer
Chapter11
Pages303-330
Number of pages28
ISBN (Print)0387254854, 9780387254852
DOIs
Publication statusPublished - 2005

Publication series

NameGerad

Bibliographical note

cgbook2005

Keywords

  • Wiskunde en Informatica (WIIN)
  • Schedule Problem
  • Completion Time
  • Linear Programming Relaxation
  • Price Problem
  • Partial Schedule

Fingerprint

Dive into the research topics of 'Applying column generation to machine scheduling'. Together they form a unique fingerprint.

Cite this