FLOWSHOP SCHEDULING WITH SET-UP, PROCESSING AND REMOVAL TIMES SEPARATED

被引：39
作者：
PROUST, C
GUPTA, JND
DESCHAMPS, V
机构：
[1] Département et Laboratoire d'Informatique, Université Frangois Rabelais, Tours, 37200, Pare de Grandmont
[2] Department of Management Science, Ball State University, Muncie, IN
来源：
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1991年 / 29卷 / 03期
关键词：
D O I：
10.1080/00207549108930084
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Algorithms are developed for finding an optimal or near-optimal permutation schedule for the static flowshop scheduling problem where set-up, processing, and removal times are separable. Computational experience with the proposed heuristic algorithms indicates that they are quite effective in minimizing the makespan for a given problem.
引用
收藏
页码：479 / 493
页数：15
相关论文
共 22 条
[1]  
Baker K.R., Introduction to Sequencing and Scheduling, pp. 136-137, (1974)
[2]  
Bernad J., La distribution log-normale dans les problemes industriels, Production Et Gestion, 252, pp. 21-27, (1973)
[3]  
Campbell H.G., Dudek R.A., Smith N.L., A heuristic algorithm for the n job, m machine sequencing problem, Management Science, 16, (1970)
[4]  
Corwin B.D., Esogbue A.O., Two-machine ftowshop scheduling problems with sequence dependent setup times: A dynamic programming approach, Naval Research Logistics Quarterly, 21, pp. 515-524, (1974)
[5]  
Dannenbring D.G., An evaluation of ftowshop sequencing heuristic, Management Science, 23, pp. 1174-1182, (1977)
[6]  
Garey M.R., Johnson D.S., Computers and Intractability: A Guided Tour to the Theory of N P-Completeness, (1979)
[7]  
Gupta J., A general algorithm for the n x M scheduling problem, International Journal of Production Research, 7, (1969)
[8]  
Gupta J., A search algorithm for generalized flow shop scheduling problem, Computers and Operations Research, 2, pp. 83-90, (1975)
[9]  
Gupta J., A Review of Flow Shop Scheduling Research. Disaggregation: Problems in Manufacturing and Service Organizations, pp. 363-388, (1979)
[10]  
Gupta J., Flowshop schedules with sequence dependent setup times, Journal of the Operations Research Society of Japan, 29, pp. 206-219, (1986)
123