Order scheduling with controllable processing times, common due date and the processing deadline
暂无分享,去创建一个
Qing Yue | Guohua Wan | Guohua Wan | Qing Yue
[1] Dvir Shabtay,et al. Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times , 2009 .
[2] Chung-Lun Li,et al. Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard , 2001, Inf. Process. Lett..
[3] A. Gunasekaran,et al. Build‐to‐order supply chain management: a literature review and framework for development , 2005 .
[4] Zuren Feng,et al. Single machine scheduling with total tardiness criterion and convex controllable processing times , 2011, Ann. Oper. Res..
[5] T.C.E. Cheng,et al. Due-date assignment and single machine scheduling with compressible processing times , 1996 .
[6] Vitaly A. Strusevich,et al. Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment , 1997, Comput. Oper. Res..
[7] Eugeniusz Nowicki,et al. A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times , 1995, Discret. Appl. Math..
[8] Ameur Soukhal,et al. Due dates assignment and JIT scheduling with equal-size jobs , 2010, Eur. J. Oper. Res..
[9] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[10] Dvir Shabtay,et al. The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times , 2008, Ann. Oper. Res..
[11] Dvir Shabtay,et al. Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling , 2011, Discret. Appl. Math..
[12] F. D. Croce,et al. The two-machine total completion time flow shop problem , 1996 .
[13] Zu-Hsu Lee,et al. Effective on-line algorithms for reliable due date quotation and large-scale scheduling , 2008, J. Sched..
[14] Dvir Shabtay,et al. Convex resource allocation for minimizing the makespan in a single machine with job release dates , 2004, Comput. Oper. Res..
[15] Bertrand M. T. Lin,et al. A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..
[16] Clyde L. Monma,et al. Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions , 1990, Math. Oper. Res..
[17] Chao-Tang Tseng,et al. Minimizing total tardiness on a single machine with controllable processing times , 2009, Comput. Oper. Res..
[18] Dirk Biskup,et al. Common due date assignment for scheduling on a single machine with jointly reducible processing times , 2001 .
[19] T. C. Edwin Cheng,et al. Two-machine open shop problem with controllable processing times , 2007, Discret. Optim..
[20] Dvir Shabtay,et al. Parallel machine scheduling with a convex resource consumption function , 2006, Eur. J. Oper. Res..
[21] Dvir Shabtay,et al. Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine , 2007, Manuf. Serv. Oper. Manag..
[22] Yong He,et al. Single-machine scheduling with trade-off between number of tardy jobs and compression cost , 2007 .
[23] Marc E. Posner,et al. Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..
[24] Dvir Shabtay,et al. Two due date assignment problems in scheduling a single machine , 2006, Oper. Res. Lett..
[25] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[26] Xiangton Qi,et al. Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method , 1998, Eur. J. Oper. Res..
[27] L. G. Mitten. Branch-and-Bound Methods: General Formulation and Properties , 1970, Oper. Res..
[28] Suresh P. Sethi,et al. Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..
[29] S. S. Panwalkar,et al. Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..
[30] M. Belcourt,et al. Outsourcing — The benefits and the risks , 2006 .
[31] Chengbin Chu,et al. A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..
[32] T. C. Edwin Cheng,et al. Single machine scheduling with a variable common due date and resource-dependent processing times , 2003, Comput. Oper. Res..
[33] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[34] Byung-Cheon Choi,et al. Complexity of a scheduling problem with controllable processing times , 2010, Oper. Res. Lett..
[35] Dvir Shabtay,et al. A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..
[36] Chengbin Chu,et al. Due date assignment and scheduling: Slk, TWK and other due date assignment models , 2002 .
[37] Klaus Jansen,et al. Approximation schemes for job shop scheduling problems with controllable processing times , 2005, Eur. J. Oper. Res..
[38] Matthew J. Sobel,et al. Manufacturing lead-time rules: Customer retention versus tardiness costs , 2005, Eur. J. Oper. Res..
[39] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..
[40] M. Spearman,et al. Optimal Lead Time Policies , 1999 .
[41] Adam Janiak,et al. Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem , 1989, Inf. Process. Lett..