论文信息 - A Functional Heuristic Algorithm for the Flowshop Scheduling Problem - 字舞流文

A Functional Heuristic Algorithm for the Flowshop Scheduling Problem

AbstractBy exploiting the relationship between scheduling and sorting, this paper describes a functional heuristic algorithm for seeking a quick and approximate solution to the n-job, M-machine flo...

Jatinder N. D. Gupta | J. Gupta

[1] Jatinder N. D. Gupta. A GENERAL ALGORITHM FOR THE n × M FLOWSHOP SCHEDULING PROBLEM† , 1968 .

[2] E. S. Page. An Approach to the Scheduling of Jobs on Machines , 1961 .

[3] R. Horn,et al. Automatic Data-Processing Systems. , 1961 .

[4] Richard A. Dudek,et al. Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .

[5] Sant Arora,et al. The Sequencing Problem , 1969 .

[6] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[7] Z. A. Lomnicki,et al. Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

[8] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .