Batching 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 4 in Multiagent Scheduling, 2014, pp 147-187 from Springer

Abstract: Abstract In this chapter, we consider batching scheduling problems in the context of agent scheduling. The main feature of these problems is the partition of the set of jobs into a number of subsets of jobs called batches. The chapter is composed of five sections. In Sect.4.1, we introduce basic definitions and notions of batching scheduling. In Sects. 4.2 and 4.3 we discuss two-agent s-batching and two-agent p-batching problems, respectively. We end the chapter with Sects. 4.4 and 4.5 including, respectively, complexity tables and bibliographic remarks.

Keywords: Completion Time; Optimal Schedule; Pareto Optimal Solution; Dynamic Programming Algorithm; Total 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_4

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

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

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