|
|||||
|
|
Nondominated Schedules for a Job-Shop with Two Competing Users |
|
| Authors: | A Agnetis PB Mirchandani D Pacciarelli A Pacifici |
| Institution: | (1) Dipartimento di Ingegneria dell'Informazione, Università di Siena, via Roma 56 -, 53xo100 Siena, Italy;(2) Department of Systems and Industrial Engineering, The University of Arizona, Tucson, AZ 85721, USA;(3) Dipartimento di Informatica e Automazione, Università di Roma Tre, Via della Vasca Navale 84, 00146 Roma, Italy;(4) Dipartimento di Informatica, Sistemi e Produzione, Università di Roma  Tor Vergata , via di Tor Vergata 110, 00133 Roma, Italy |
| 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 |
| 本文献已被 SpringerLink 等数据库收录！ | |