Scheduling Problems with Two Competing Agents

References

• Agnetis A., Mirchandani P. B., Pacciarelli D., Pacifici A. Nondominated schedules for a job-shop with two competing agents. Comput. Math. Organ. Theory (2000) 6(2):191–217Crossref, Google Scholar
• Brewer P. J., Plott C. R. A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks. Internat. J. Indust. Organ. (1996) 14:857–886Crossref, Google Scholar
• Chen C.L., Bulfin R. L. Scheduling unit processing times jobs on a single machine with multiple criteria. Comput. Oper. Res. (1990) 17(1):1–7Crossref, Google Scholar
• Chen C. L., Bulfin R. L. Complexity of single machine, multi-criteria scheduling problems. Eur. J. Oper. Res. (1993) 70(1):115–125Crossref, Google Scholar
• Chen Y., Peng Y., Finin T., Labrou Y., Cost S., Chu B., Yao J., Sun R., Wilhelm B. A negotiation-based multi-agent system for supply chain management. Proc. Agents'99 Workshop Agent-Based Decision-Support for Managing Internet-Enabled Supply-Chain (1999) Seattle, WA:15–20Google Scholar
• Creès H., Moulin H. Scheduling with opting out: Improving upon random priority. Oper. Res. (2001) 49(4):565–577Link, Google Scholar
• Curiel I., pederzoli G., Tijs S. Sequencing games. Eur. J. Oper. Res. (1989) 40:344–351Crossref, Google Scholar
• Fragnelli V. On the balancedness of semi-infinite sequencing games. (2001) . Preprint no. 442, Dipartimento di Matematica, Università di Genova, Genoa, ItalyGoogle Scholar
• Garey M. R., Johnson D. S.Computers and Intractability (1979) (Freeman, New York) Google Scholar
• Graham R. L., Lawler E. L., lenstra J. K., Rinnooy Kan A. H. G. Optimization and approximation in deterministic machine scheduling: A survey. Ann. Discrete Math. (1979) 5:287–326Crossref, Google Scholar
• Hamers H., Borm P., Tijs S. On games corresponding to sequencing situations with ready times. Math. Programming (1995) 70:1–13Crossref, Google Scholar
• Hamers H., Suijs J., Tijs S., Borm P. The split core for sequencing games. Games Econom. Behavior (1996) 15:165–176Crossref, Google Scholar
• Hoogeveen J. A.Single-Machine Bicriteria Scheduling. (1992) . Ph.D. thesis, Technische Universiteit Eindhoven Eindhoven, The NetherlandsGoogle Scholar
• Hoogeveen J. A., van de Velde S. L. Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper. Res. Lett. (1995) 17:205–208Crossref, Google Scholar
• Hoogeveen J. A., van de Velde S. L. Scheduling with target start times. Eur. J. Oper. Res. (2001) 129:87–94Crossref, Google Scholar
• Huange X., Hallam J. C. Spring-based negotiation for conflict resolution in AGV scheduling. Proc. IEEE Internat. Conf. Systems, Man Cybernetics: Intelligent Systems for the 21st Century. (1995) (IEEE Press, Vancouver, WA) 789–794Crossref, Google Scholar
• Karp R., Miller R. E., Thatcher J.W. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) 85–103Crossref, Google Scholar
• Kim K., Paulson B. C., Petrie C. J., Lesser V. R. Compensatory negotiation for agent-based project schedule coordination. (1999) . CIFE working paper #55, Stanford University, Stanford, CAGoogle Scholar
• Lawler E. L. Optimal sequencing of a single machine subject to precedence constraints. Management Sci. (1973) 19:544–546Link, Google Scholar
• Lawler E. L. Scheduling a single machine to minimize the number of late jobs. (1983) . Working paper #CSD-83-139, Computer Science Division, University of California, Berkeley, CAGoogle Scholar
• Lenstra J. K., Rinnooy Kan A. H. G., Brucker P. Complexity of machine scheduling problems. Ann. Discrete Math. (1977) 1:343–362Crossref, Google Scholar
• Livshits E. M. Minimizing the maximal penalty in a single machine problem. Trans. 1st Winter School Math. Programming (1969) (Drogobych, Ukraine) 454–475(in Russian)Google Scholar
• Moore J. M. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. (1968) 15:102–109Link, Google Scholar
• Nagar J., Haddock J. C., Heragu S. Multiple and bicriteria scheduling: A literature survey. Eur. J. Oper. Res. (1995) 81:88–104Crossref, Google Scholar
• Schultz D., Oh S.-H., Grecas C. F., Albani M., Sanchez J., Arbib C., Arvia V., Servilio M., Del Sorbo F., Giralda A., Lombardi G. A QoS concept for packet oriented S-UMTS services. Proc. 1st Mobile Summit 2002 (2002) (Thessaloniki, Greece) Google Scholar
• Shen L. Logistics with two competing agents. (1998) . Ph.D. thesis, Faculty of Systems and Industrial Engineering, The University of Arizona, Tucson, AZGoogle Scholar
• Smith W. E. Various optimizers for single stage production. Naval Res. Logist. Quart. (1956) 3(1):59–66Crossref, Google Scholar
• Wellman M. P. A market-oriented programming environment and its applications to distributed multicommodity flow problems. J. Artificial Intelligence Res. (1993) 1:1–23Crossref, Google Scholar
• Wellman M. P., Walsh W. E., Wurman P. R., MacKie-Mason J. K. Auction protocols for decentralized scheduling. Games Econom. Behavior (2001) 35(1–2):271–303Crossref, Google Scholar