Single Machine Problems

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 3 in Multiagent Scheduling, 2014, pp 57-145 from Springer

Abstract: Abstract This chapter is devoted to single-machine agent scheduling problems. We present most of the results for the case of two agents (K = 2), for simplicity and because the most of the results found so far in the literature apply to this case. Whenever it is possible, we illustrate how these results can be extended to scenarios with a larger number of agents.

Keywords: WSPT Order; Pareto Optimal Schedules; Reference Schedule; Bicriteria; Unscheduled Jobs (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_3

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

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

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