Nondominated Schedules for a Job-Shop with Two Competing Users

Authors:
A. Agnetis;P. B. Mirchandani;D. Pacciarelli;A. Pacifici
Affiliations:
Dipartimento di Ingegneria dell'Informazione, Università di Siena, via Roma 56 - 53xo100 Siena, Italy;Department of Systems and Industrial Engineering, The University of Arizona, Tucson, AZ 85721, USA;Dipartimento di Informatica e Automazione, Università di Roma Tre, Via della Vasca Navale 84, 00146 Roma, Italy;Dipartimento di Informatica, Sistemi e Produzione, Università di Roma “Tor Vergata”, via di Tor Vergata 110, 00133 Roma, Italy
Venue:
Computational & Mathematical Organization Theory
Year:
2000

Citing 5
Cited 6

An efficient algorithm for the job-shop problem with two jobs

Computing
Sequencing with earliness and tardiness penalties: a review

Operations Research
Optimal pacing of trains in freight railroads: model formulation and solution

Operations Research
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
A fast heuristic for the train scheduling problem

Computers and Operations Research

A Multiple-Criterion Model for Machine Scheduling

Journal of Scheduling
A Lagrangian approach to single-machine scheduling problems with two competing agents

Journal of Scheduling
Single-machine scheduling problems with two agents competing for makespan

LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part I
Scheduling two agents on uniform parallel machines with makespan and cost functions

Journal of Scheduling
Single-machine multi-agent scheduling problems with a global objective function

Journal of Scheduling
Two-Agent scheduling on an unbounded serial batching machine

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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.