Competitive Two-Agent Scheduling and Its Applications

References

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