A Framework for the Complexity of High-Multiplicity Scheduling Problems

N. Brauner (), Y. Crama (), A. Grigoriev () and J. Klundert ()
Additional contact information
N. Brauner: Laboratoire Leibniz-IMAG
Y. Crama: University of Liège
A. Grigoriev: Maastricht University
J. Klundert: Maastricht University

Journal of Combinatorial Optimization, 2005, vol. 9, issue 3, No 6, 313-323

Abstract: 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.

Keywords: computational complexity; design of algorithms; scheduling; high multiplicity (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-005-1414-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jcomop:v:9:y:2005:i:3:d:10.1007_s10878-005-1414-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-005-1414-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().