Reference : A framework for the complexity of high-multiplicity scheduling problems
Scientific journals : Article
Business & economic sciences : Production, distribution & supply chain management
http://hdl.handle.net/2268/1721
A framework for the complexity of high-multiplicity scheduling problems
English
Brauner, Nadia [> > > >]
Crama, Yves mailto [Université de Liège - ULg > HEC - Ecole de gestion de l'ULg > Recherche opérationnelle et gestion de la production >]
Grigoriev, Alexander [> > > >]
van de Klundert, Joris [> > > >]
May-2005
Journal of Combinatorial Optimization
Springer
9
3
313-323
Yes
International
1382-6905
Dordrecht
[en] computational complexity ; design of algorithms ; scheduling ; high multiplicity
[en] 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.
Researchers
http://hdl.handle.net/2268/1721
10.1007/s10878-005-1414-7
The original publication is available at www.springerlink.com

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
JOCO Feb26 2005.pdfNo commentaryAuthor postprint121.66 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.