Algorithms for Assembly Type Flowshop Scheduling Problem

作     者：李晓渝 晋一 关秦川 Li Xiaoyu Jin Yi Guan Qinchuan (1. School of Civil Engineering, Southwest Jiaotong University,Chengdu 610031, China;2.Shool of Gold Industry, San Men Xia 472000, China;3. Institute of Mechanics Engineering, Southwest Jiaotong University, Chengdu 610031, China)

作者机构：School of Civil Engineering Southwest Jiaotong UniversityChengdu 610031 China Shool of Gold Industry San Men Xia 472000 China Institute of Mechanics Engineering Southwest Jiaotong University Chengdu 610031 China 

出 版 物：《Journal of Modern Transportation》 (现代交通学报（英文版）)

年 卷 期：2000年第17卷第1期

页      面：99-105页

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

主　　题：flowshop scheduling assembly type production algorithm makespan 

摘      要：An assembly type flowshop scheduling problem with minimizing makespan is considered in this paper. The problem of scheduling for minimizing makespan is first addressed, and then a new heuristic algorithm is proposed for it.