Competitive two-agent scheduling and its applications

Operations Research

Volumn 58, Issue 2, 2010, Pages 458-469

  Leung, Joseph Y T ^a   Pinedo, Michael ^b   Wan, Guohua ^c  

^a University Heights   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c Shanghai Jiao Tong University   (China)

Author keywords

Games group decisions: cooperative sequencing; Parallel machines; Production scheduling: multiagent deterministic sequencing; Single machine

Indexed keywords

COOPERATIVE SEQUENCING; GAMES/GROUP DECISIONS; MULTIAGENT DETERMINISTIC SEQUENCING; PARALLEL MACHINE; PRODUCTION/SCHEDULING; SINGLE MACHINES;

SCHEDULING;

EID: 77951147055     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1090.0744     Document Type: Article

References (27)

1. Agnetis, A., D. Pacciarelli, A. Pacifici. 2007. Multi-agent single machine scheduling. Ann. Oper. Res. 150 3-15.
2. Agnetis, A., P. B. Mirchandani, D. Pacciarelli, A. Pacifici. 2004. Scheduling problems with two competing agents. Oper. Res. 52 229-242.
3. Baker, K. R., J. C. Smith. 2003. A multiple-criterion model for machine scheduling. J. Scheduling 6 7-16.
4. Baptiste, P. 1999. An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24 175-180.
5. Cheng, T. C. E., C. T. Ng, J. J. Yuan. 2006. Two-agent scheduling on a single machine with fixed jobs and preemption. Working paper, Department of Logistics, Hong Kong Polytechnic University.
6. Cheng, T. C. E., C. T. Ng, J. J. Yuan. 2007. Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoret. Comput. Sci. 362 273-281.
7. Cheng, T. C. E., C. T. Ng, J. J. Yuan. 2008. Multi-agent scheduling on a single machine with max-form criteria. Eur. J. Oper. Res. 188 603-609.
8. Curiel, I., H. Hamers, F. Klijn. 2002. Sequencing games: A survey. P. E. M. Borm, H. J. M. Peeters, eds. Chapters in Game Theory. Theory and Decision Library, Vol.31. Kluwer Academic Publishers, Dordrecht, The Netherlands.
9. Du, J., J. Y.-T. Leung. 1990. Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15 483-495.
10. Du, J., J. Y.-T. Leung, C. S. Wong. 1992. Minimizing the number of late jobs with release time constraint. J. Combin. Math. Combin. Comput. 11 97-107.
11. Du, J., J. Y.-T. Leung, G. H. Young. 1990. Minimizing mean flow time with release time constraint. Theoret. Comput. Sci. 75 347-355.
12. Hall, N. G., C. N. Potts. 2004. Rescheduling for new orders. Oper. Res. 52 440-453.
13. Horn, W. A. 1974. Some simple scheduling algorithms. Naval Res. Logist. Quart. 21 177-185.
14. Huo, Y., J. Y.-T. Leung, H. Zhao. 2007. Complexity of two dual criteria scheduling problems. Oper. Res. Lett. 35 211-220.
15. Lawler, E. L. 1973. Optimal sequencing of a single machine subject to precedence constraints. Management Sci. 19 544-546.
16. Lawler, E. L. 1977. A "pseudo-polynomial" time algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1 331-342.
17. Lawler, E. L. 1979. Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs. Report BW 105, Mathematisch Centrum, Amsterdam.
18. Lawler, E. L. 1982. Recent results in the theory of machine scheduling. A. Bachem, M. Grotschel, B. Kortel, eds. Mathematical Programming: The State of the Art. Springer-Verlag, Berlin.
19. Lawler, E. L. 1990. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Oper. Res. 26 125-133.
20. Lawler, E. L., C. U. Martel. 1989. Preemptive scheduling of two uniform machines to minimize the number of late jobs. Oper. Res. 37 314-318.
21. Lee, C.-Y. 2004. Machine scheduling with availability constraints. J. Y.-T. Leung, ed. Handbookof Scheduling: Algorithms, Models and Performance Analysis, Chapter 22. CRC Press, Boca Raton, FL.
22. Leung, J. Y.-T., M. Pinedo. 2003. A note on scheduling parallel machines subject to breakdown and repair. Naval Res. Logist. 50 60-71.
23. Leung, J. Y.-T., M. Pinedo, G. Wan. 2006. Competitive two-agent scheduling and its applications. Technical report, Department of Computer Science, New Jersey Institute of Technology, Newark, NJ. (Also, Technical report, Stern School of Business, New York University, New York.)
24. Moore, J. M. 1968. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 15 102-109.
25. Ng, C. T., T. C. E. Cheng, J. J. Yuan. 2006. A note on the complexity of the problem of two-agent scheduling on a single machine. J. Combin. Optim. 12 387-394.
26. Pinedo, M. 2002. Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Upper Saddle River, NJ.
27. Sahni, S. 1979. Preemptive scheduling with due dates. Oper. Res. 27 925-934.