Single-machine two-agent scheduling involving a just-in-time criterion
暂无分享,去创建一个
Omri Dover | Dvir Shabtay | Moshe Kaspi | Moshe Kaspi | D. Shabtay | O. Dover | M. Kaspi | Omri Dover
[1] Gur Mosheiov,et al. Single machine scheduling to minimize the number of early and tardy jobs , 1996, Comput. Oper. Res..
[2] Jose M. Framiñan,et al. A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems , 2014, Eur. J. Oper. Res..
[3] Weiping Shang,et al. A note on the scheduling with two families of jobs , 2005, J. Sched..
[4] Wen-Chiung Lee,et al. A single-machine scheduling problem with two-agent and deteriorating jobs , 2010 .
[5] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[6] Chung-Yee Lee,et al. Machine scheduling with an availability constraint , 1996, J. Glob. Optim..
[7] Ameur Soukhal,et al. Two-Agent Scheduling on an Unbounded Serial Batching Machine , 2012, ISCO.
[8] Errol L. Lloyd,et al. on the K-coloring of Intervals , 1991, Discret. Appl. Math..
[9] Jonathan Cole Smith,et al. A Multiple-Criterion Model for Machine Scheduling , 2003, J. Sched..
[10] Dvir Shabtay,et al. Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems , 2010, Journal of Scheduling.
[11] Ron Shamir,et al. Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem , 1991, Oper. Res..
[12] Frank Werner,et al. Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey , 2004, Math. Comput. Model..
[13] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[14] Esther M. Arkin,et al. Scheduling jobs with fixed start and end times , 1987, Discret. Appl. Math..
[15] Stefano Giordano,et al. A survey on multi-constrained optimal path computation: Exact and approximate algorithms , 2010, Comput. Networks.
[16] Alessandro Agnetis,et al. Scheduling Problems with Two Competing Agents , 2004, Oper. Res..
[17] Dvir Shabtay,et al. The just-in-time scheduling problem in a flow-shop scheduling system , 2012, Eur. J. Oper. Res..
[18] Gur Mosheiov,et al. Single machine batch scheduling with two competing agents to minimize total flowtime , 2011, Eur. J. Oper. Res..
[19] Shao Chin Sung,et al. Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines , 2005, J. Sched..
[20] Byung-Cheon Choi,et al. Maximizing the weighted number of just-in-time jobs in flow shop scheduling , 2007 .
[21] Joseph Y.-T. Leung,et al. Competitive Two-Agent Scheduling and Its Applications , 2010, Oper. Res..
[22] Refael Hassin,et al. Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..
[23] Chengbin Chu,et al. A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..
[24] T. C. Edwin Cheng,et al. An Improved FPTAS for Mobile Agent Routing with Time Constraints , 2011, J. Univers. Comput. Sci..