A Framework for the complexity of high multiplicity scheduling problems

N. Brauner, Y. Crama, A. Grigoriev, G.E. Pierard

Research output: Contribution to journalArticleAcademicpeer-review

14 Citations (Scopus)

Abstract

The purpose of this note is to propose a complexity framework for the analysis of high multiplicity scheduling problems. Part of this framework relies on earlier work aiming at the definition of output-sensitive complexity measures for the analysis of algorithms which produce “large” outputs. However, different classes emerge according as we look at schedules as sets of starting times, or as related single-valued mappings.
Original languageEnglish
Pages (from-to)313-323
Number of pages11
JournalJournal of Combinatorial Optimization
Volume9
Issue number3
DOIs
Publication statusPublished - 1 Jan 2005

Cite this