[1] Pinedo M.Scheduling:theory, algorithm, and systems [M].Englewood Chills, NJ:Prentice-Hall, 1995.
[2] Hall N G, Sriskandarajah C.A survey of machine scheduling problems with blocking and no-wait in process [J].Operations Research, 1996, 44(3):510-525.
[3] Rajendran C.A no-wait flowshop scheduling heuristic to minimize makespan[J].Journal of the Operational Research Society, 1994, 45(4):472-478.
[4] Wang L, Zheng D Z.An effective hybrid optimization strategy for job-shop scheduling problem [J].Computer and Operation Research, 2001, 28(6):585-596.
[5] MacCarthy B L, Liu J.Addressing the gap in scheduling research:a review of optimization and heuristic methods in production scheduling [J].International Journal of Production Research, 1993, 31(1):59-79.
[6] van Deman J M, Baker K R.Minimizing mean flow time in the flowshop with no intermediate queues [J].AIIE Transactions, 1974, 6(1):28-34.
[7] Adiri I, Pohoryles D.Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times [J].Navel Research Logistics Quarterly, 1982, 29(3):495-504.
[8] van der Veen J A A, van Dal R.Solvable cases of the no-wait flowshop scheduling problem [J].Journal of the Operational Research Society, 1991, 42(11):971-980.
[9] Rajendran C, Chaudhuri D.Heuristic algorithms for continuous flow-shop problem [J].Naval Research Logistics, 1990, 37(5):695-705.
[10] Bonney M C, Gundry S W.Solutions to the constrained flow-shop sequencing problem [J].Operational Research Quart, 1976, 27(4):869-883.
[11] King J R, Spachis A S.Heuristics for flow-shop scheduling [J].International Journal of Production Research, 1980, 18(3):343-357.
[12] Bertolissi Edy.Heuristic algorithm for scheduling in the no-wait flow-shop [J].Journal of Materials Processing Technology, 2000, 107(1/2/3):459-465.
[13] Bertolissi Edy.A simple no-wait flow-shop scheduling heuristic for the no-wait flowshop problem[C]//Proceedings of the 15th International Conference on Computer-Aided Production Engineering, CAPE’99.Durham, UK, 1999.
[14] Chen C L, Neppalli R V, Aljaber N.Generic algorithms applied to the continuous flow shop problem [J].Computers and Industrial Engineering, 1996, 30(4):919-929.
[15] Fink A, Voβ S.Solving the continuous flow-shop scheduling heuristic to minimize makespan[J].Journal of the Operational Research, 2003, 151(3):400-414.
[16] Taillard E.Benchmarks for basic scheduling problems [J].European Journal of Operational Research, 1993, 64(2):278-285.
[17] Aldowaisan T, Allahverdi A.New heuristics for m-machine no-wait flowshop to minimize total completion time [J].OMEGA, 2004, 32(5):345-352.
[18] Ruiz Rubén, Maroto Concepción, Alcaraz Javier.Two new robust algorithms for the flowshop scheduling problem [J].OMEGA, 2006, 34(5):461-476.
[19] Iyer Srikanth K, Saxena Barkha.Improved genetic algorithm for the permutation flowshop scheduling problem [J].Computers and Operations Research, 2004, 31(4):593-606.
[20] Blum Christian, Andrea Roli.Metaheuristics in combinatorial optimization:overview and conceptual comparison [J].ACM Computing Surveys, 2003, 35(3):268-308.
[21] Li Xiaoping.Heuristic for no-wait flow shops with makespan minimization [J].International Journal of Production Research, 2008, 46(9):2519-2530.
[22] Rajendran C, Ziegler H.An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs [J].European Journal of Operational Research, 1997, 103(1):129-138.
[23] Abramson N.Information theory and coding [M].New York:McGraw-Hill, 1963:129.