Flexible flow shop scheduling with uniform parallel machines
暂无分享,去创建一个
[1] Maged Dessouky,et al. MULTISTAGE HYBRID FLOWSHOP SCHEDULING WITH IDENTICAL JOBS AND UNIFORM PARALLEL MACHINES , 1999 .
[2] Salah E. Elmaghraby,et al. Sequencing Three-Stage Flexible Flowshops with Identical Machines to Minimize Makespan , 2001 .
[3] George L. Vairaktarakis,et al. Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..
[4] Imre Bárány,et al. A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees , 1981, Math. Oper. Res..
[5] Oscar H. Ibarra,et al. Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..
[6] Tsung-Chyan Lai,et al. A Note on Heuristics of Flow-Shop Scheduling , 1996, Oper. Res..
[7] Christos Koulamas,et al. Assembly-Line Scheduling with Concurrent Operations and Parallel Machines , 2002, INFORMS J. Comput..
[8] Sartaj Sahni,et al. Bounds for List Schedules on Uniform Processors , 1980, SIAM J. Comput..
[9] Christos Koulamas,et al. Asymptotically optimal linear time algorithms for two‐stage and three‐stage flexible flow shops , 2000 .
[10] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[11] Bo Chen,et al. Scheduling Multiprocessor Flow Shops , 1994 .
[12] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .
[13] Sergey Vasil'evich Sevast'janov,et al. Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops , 1995, Math. Oper. Res..
[14] HANIJANTO SOEWANDI,et al. Sequencing three-stage flexible flowshops with identical machines to minimize makespan , 2001 .
[15] S. Sevast’yanov. Bounding algorithm for the routing problem with arbitrary paths and alternative servers , 1986 .
[16] D. Du,et al. Advances in optimization and approximation , 1994 .
[17] Chris N. Potts,et al. The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..
[18] Sergey Vasil'evich Sevast'janov,et al. on Some Geometric Methods in Scheduling Theory: A Survey , 1994, Discret. Appl. Math..
[19] David B. Shmoys,et al. Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.
[20] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .
[21] Christos Koulamas,et al. Scheduling on uniform parallel machines to minimize maximum lateness , 2000, Oper. Res. Lett..
[22] Jan Karel Lenstra,et al. PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .