Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine
暂无分享,去创建一个
[1] Eugeniusz Nowicki,et al. A survey of results for sequencing problems with controllable processing times , 1990, Discret. Appl. Math..
[2] Bahram Alidaee,et al. Two parallel machine sequencing problems involving controllable job processing times , 1993 .
[3] Michael A. Trick,et al. Scheduling Multiple Variable-Speed Machines , 1990, Oper. Res..
[4] Lei Lei,et al. Solving a class of two-resource allocation problem by equivalent load method , 1997 .
[5] Matthew J. Sobel,et al. Manufacturing lead-time rules: Customer retention versus tardiness costs , 2005, Eur. J. Oper. Res..
[6] 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..
[7] Clyde L. Monma,et al. Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions , 1990, Math. Oper. Res..
[8] T. C. Edwin Cheng,et al. Single machine scheduling with a variable common due date and resource-dependent processing times , 2003, Comput. Oper. Res..
[9] R. Armstrong,et al. An O(N log (1/ɛ)) Algorithm for the Two-resource Allocation Problem with a Non-differentiable Convex Objective Function , 1995 .
[10] Adam Janiak,et al. Single machine scheduling subject to deadlines and resource dependent processing times , 1996 .
[11] Chengbin Chu,et al. Due date assignment and scheduling: Slk, TWK and other due date assignment models , 2002 .
[12] Dirk Biskup,et al. Common due date assignment for scheduling on a single machine with jointly reducible processing times , 2001 .
[13] Dvir Shabtay,et al. Two due date assignment problems in scheduling a single machine , 2006, Oper. Res. Lett..
[14] Dvir Shabtay,et al. Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine , 2004, Comput. Oper. Res..
[15] R. Jackson. Inequalities , 2007, Algebra for Parents.
[16] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.
[17] Han Hoogeveen,et al. Some Comments on Sequencing with Controllable Processing Times , 2002, Computing.
[18] T. C. Edwin Cheng,et al. Bicriterion Single Machine Scheduling with Resource Dependent Processing Times , 1998, SIAM J. Optim..
[19] C. Scott,et al. Allocation of resources in project management , 1995 .
[20] T. C. Edwin Cheng,et al. Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs , 1993, Discret. Appl. Math..
[21] K. R. Baker,et al. A bicriterion approach to time/cost trade-offs in sequencing , 1982 .
[22] Dvir Shabtay,et al. Minimizing the total weighted flow time in a single machine with controllable processing times , 2004, Comput. Oper. Res..
[23] Chris N. Potts,et al. Supply chain scheduling: Batching and delivery , 2003, Oper. Res..
[24] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[25] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[26] C. T. Ng,et al. Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time , 2005, Ann. Oper. Res..
[27] Adam Janiak,et al. One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints , 1987, Kybernetika.
[28] Prabuddha De,et al. Optimal Delivery Time Quotation and Order Sequencing , 1991 .