Just-in-time Scheduling with Multiple Competing Agents
暂无分享,去创建一个
[1] Alessandro Agnetis,et al. Multi-agent single machine scheduling , 2007, Ann. Oper. Res..
[2] Byung-Cheon Choi,et al. Maximizing the weighted number of just-in-time jobs in flow shop scheduling , 2007 .
[3] T. C. Edwin Cheng,et al. Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs , 2006, Theor. Comput. Sci..
[4] Chris N. Potts,et al. Rescheduling for New Orders , 2004, Oper. Res..
[5] Wen-Chiung Lee,et al. A two-machine flowshop problem with two agents , 2011, Comput. Oper. Res..
[6] Shao Chin Sung,et al. Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines , 2005, J. Sched..
[7] Gur Mosheiov,et al. Single machine scheduling to minimize the number of early and tardy jobs , 1996, Comput. Oper. Res..
[8] Alessandro Agnetis,et al. Scheduling Problems with Two Competing Agents , 2004, Oper. Res..
[9] Byung-Cheon Choi,et al. Approximation algorithms for multi-agent scheduling to minimize total weighted completion time , 2009, Inf. Process. Lett..
[10] Shao Chin Sung,et al. A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines , 2005, Comput. Oper. Res..
[11] Kunihiko Hiraishi,et al. Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs , 2000, Comput. Oper. Res..
[12] Claudio Arbib,et al. A competitive scheduling problem and its relevance to UMTS channel assignment , 2004, Networks.
[13] Kurt Mehlhorn,et al. Faster algorithms for the shortest path problem , 1990, JACM.
[14] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[15] Joseph Y.-T. Leung,et al. Competitive Two-Agent Scheduling and Its Applications , 2010, Oper. Res..
[16] T. C. Edwin Cheng,et al. A note on the complexity of the problem of two-agent scheduling on a single machine , 2006, J. Comb. Optim..