Scheduling Problems with Variable Job Processing Times

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 6 in Multiagent Scheduling, 2014, pp 217-260 from Springer

Abstract: Abstract In this chapter, we consider agent scheduling problems in which job processing times are variable. Processing time variable This means that the processing times, contrary to other chapters of the book, are not fixed and may change depending on such parameters as job starting times, job positions in schedule or the amount of resources allocated to jobs. Though problems of this type appear in many applications and non-fixed job processing times are studied in scheduling theory from over a few decades, agent scheduling problems with variable job processing times only recently started to be a new subject of research.

Keywords: Processing Time; Schedule Problem; Ageing Effect; Total Tardiness; Total Weighted Completion 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_6

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

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

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