Parallel Machine Scheduling 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 5 in Multiagent Scheduling, 2014, pp 189-215 from Springer

Abstract: Abstract This chapter, presents some results on scheduling jobs on parallel machines in the Competitive and the Interfering scenarios. First, we study the case where job preemption is allowed, i.e. when the processing of a job can be interrupted and resumed later, possibly on another machine. Next, we study the case without job preemption. The chapter is composed of five sections. In Sect. 5.1, we consider parallel machine scheduling problems without job preemption. In Sects. 5.2 and 5.3, we consider preemptable parallel machine scheduling problems with arbitrary and equal job processing times, respectively. We end the chapter with Sects. 5.4 and 5.5 including, respectively, complexity tables and bibliographic remarks.

Keywords: Parallel Machine Scheduling Problem; Total Completion Time; Optimal Makespan Value; Pareto Solutions; Pseudo-polynomial Time (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_5

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

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

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