Scheduling jobs on unrelated parallel machines to minimize regular total cost functions
暂无分享,去创建一个
[1] J. J. Brennan,et al. An Improved Algorithm for Scheduling Jobs on Identical Machines , 1977 .
[2] W. A. Horn. Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..
[3] Meral Azizoglu,et al. On the minimization of total weighted flow time with identical and uniform parallel machines , 1999, Eur. J. Oper. Res..
[4] Kenneth R. Baker,et al. Scheduling with parallel processors and linear delay costs , 1973 .
[5] Salah E. Elmaghraby,et al. On the Scheduling of Jobs on a Number of Identical Machines. , 1972 .
[6] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.
[7] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[8] S. Sarin,et al. An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime , 1988 .
[9] L. Gelders,et al. Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory , 2015, Oper. Res..
[10] Chris N. Potts,et al. Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time , 1994, Discret. Appl. Math..
[11] Shimon Even,et al. Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .
[12] B. J. Lageweg,et al. Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..