References
- GELDEES , L. F. , and SAMBANDAM , N. , 1978 , Four simple heuristics for scheduling a flowshop , Int. J. Prod. Res ., 16 , 221 .
- HELD , M. , and KARP , R. M. , 1971 , The travelling salesman problem and minimal spanning trees , Math. prog ., 1 , 6 .
- LITTGER , K. E. , 1976 , A new approach for the optimal solution to the M×J production Scheduling problem , Int.J.Prod. res. , 14 , 77 .
- LITTLE , J.D.C. , MURTY , K. G. , SWEENEY , D. W. , and KABEL , C. , 1963 , An algorithm for the travelling salesman problem , Ops. Res. , 13 ; 400 .
- LOCKETT , A. G. , and MUHLEMANN , A. P. , 1972 , A Scheduling problem inolving sequence dependent changeover times , Ops. res ., 20 895 .
- MUHLEMANN , A. P. , and LOCKETT , A. G. , 1975 , A Scheduling problem with machine flexibility , Int. J. Prod, Res ., 13 , 1 .
- NICHOLS , R. A. , BULFIN , R. L. , PARDER , R. G. , 1978 , An interactive procedure for minimizing makespan on parallel processors , Int J Prod Res ., 16 77 .
- ROCHETTE , R. , and SADOWSKI , R. P. , 1976 , A Statistical comparison of the performance of simple dispatching rules for a particular set of job shops , Int. J. prod. Res ., 14 , 63 .
- WHITE , C. H. , and WILLSON , R. C. , 1977 , Sequence dependent set-up times and job sequencing , Int. J. Prod Res ., 15 , 191 .