On a New Class of Parallel Sequencing Situations and Related Games

Pedro Calleja (), Peter Borm, Herbert Hamers, Flip Klijn and Marco Slikker

Annals of Operations Research, 2002, vol. 109, issue 1, 265-277

Abstract: This paper considers a special class of sequencing situations with two parallel machines in which each agent has precisely two jobs to be processed, one on each machine. The costs of an agent depend linearly on the final completion time of his jobs. We describe a procedure that provides an optimal processing order of the jobs for some particular classes. Furthermore, we study cooperative games arising from these sequencing situations. Our main result will be on the balancedness of these games. Copyright Kluwer Academic Publishers 2002

Keywords: cooperative game theory; scheduling; balancedness (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1016360404530 (text/html)
Access to full text is restricted to subscribers.

Related works:
Working Paper: On a new class of parallel sequencing situations and related games (2002)
Working Paper: On a New Class of Parallel Sequencing Situations and Related Games (2001)
Working Paper: On a New Class of Parallel Sequencing Situations and Related Games (2001)
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:annopr:v:109:y:2002:i:1:p:265-277:10.1023/a:1016360404530

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1016360404530

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().