共 10 条
[1]
A heuristic algorithm for the n-jobs, m-machine sequencing problem. CAMPBELL H G,DUDEK R A,SMITH M L. Management Science . 1970
[2]
The complexity of flow shop and job shop scheduling. GAREY M R,JOHNSON D S,SETHI R. Mathematics of Operations Research . 1976
[3]
Complexity of machine scheduling problems. LENSTRA J K,RINNOOY Kan AHG,BRUCKER P. Annals of Discrete Mathematics . 1977
[4]
Benchmark for basic scheduling problems. TAILARD E. European Journal of Operational Research . 1993
[5]
A block approach for single-machine scheduling with release dates and due dates. GRABOWSKI J,NOWICKI E,ZDRALKA S. European Journal of Operational Research . 1986
[6]
On flow shop scheduling with release and due dates to minimize maximum lateness. GRABOWSKI J,SKUBALSKA E,SMUTNICKI C. J of Operational Research Society . 1983
[7]
Optimization by simulated annealing. Kirkpatrick S,Gelatt C D Jr,Vecchi M P. Science . 1983
[8]
Simulated annealing for permulation flow shop scheduling. OSMAN I H,POTTS C N. Int J.of Management Science . 1989
[9]
Some efficient heuristic methods for the flow shop seqencing problem. TAILLARD E. European Journal of Operational Research . 1990
[10]
A heuristic algorithm for the n-job, m-machine flow shop sequencing problems. NAWAZ M,EMSCORE Jr E E,HAM I. Int J of Management Science . 1983