Nondominated Schedules for a Job-Shop with Two Competing Users

A. Agnetis, P.B. Mirchandani, D. Pacciarelli and A. Pacifici
Additional contact information
A. Agnetis: Università di Siena
P.B. Mirchandani: The University of Arizona
D. Pacciarelli: Università di Roma Tre
A. Pacifici: Università di Roma “Tor Vergata”

Computational and Mathematical Organization Theory, 2000, vol. 6, issue 2, No 5, 217 pages

Abstract: Abstract We consider the scenario where two users compete to perform their respective jobs on a common set of resources. The job for each user has a due-date and the cost function associated with the due-date is quasi-convex (i.e., it has a single local minimum). We characterize the set of nondominated schedules over which the users may negotiate and develop a polynomial algorithm to find this nondominated set.

Keywords: scheduling; negotiation; coordination; job shop; nonregular objective function; Pareto-optimality (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009637419820 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:comaot:v:6:y:2000:i:2:d:10.1023_a:1009637419820

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

DOI: 10.1023/A:1009637419820

Access Statistics for this article

Computational and Mathematical Organization Theory is currently edited by Terrill Frantz and Kathleen Carley

More articles in Computational and Mathematical Organization Theory from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().