Problems, Algorithms and Complexity

Alessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli and Ameur Soukhal
Additional contact information
Alessandro Agnetis: Università di Siena
Jean-Charles Billaut: Université François Rabelais Tours
Stanisław Gawiejnowicz: Adam Mickiewicz University
Dario Pacciarelli: Università Roma Tre
Ameur Soukhal: Université François Rabelais Tours

Chapter Chapter 2 in Multiagent Scheduling, 2014, pp 23-55 from Springer

Abstract: Abstract In this chapter, the basic notions related to problems, algorithms and complexity are recalled. Some topics related to approximability, problem relaxation and simple reductions between scheduling problems are also discussed. The chapter is composed of eight sections. Basic notions of complexity theory are recalled as well as properties of NP-complete and NP-hard problems. Exact and enumerative algorithms are discussed, and approximation algorithms and approximation schemes are considered. Methods of problems relaxation are presented. Some reductions between scheduling problems are described. The chapter ends with remarks on references.

Keywords: Schedule Problem; Mixed Integer Linear Programming; Lagrangian Relaxation; Linear Programming Relaxation; Flow Shop Schedule Problem (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

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-3-642-41880-8_2

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

DOI: 10.1007/978-3-642-41880-8_2

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