摘要
为了提高设备的协同作业能力,基于采用双40岸桥和边装边卸工艺的集装箱作业系统,提炼出新的三阶段混合流水车间问题。其中,第一阶段和第三阶段有多台批处理机和非批处理机,第二阶段为非批处理机;各阶段之间无缓冲区;存在进口箱和出口箱等工件族,都依次经历三个阶段,不同工件族工件在第一阶段和第三阶段由不同类型机器加工。以最小化总完工时间为目标函数,对该问题建立混合整数线性规划模型,提出基于设备状态变迁的协同算法,根据第二阶段设备状态变化和批处理优先,动态构建工件在三阶段混合流水车间中的加工路径,以尽量减少工件在第二阶段的准备时间和其他阶段的阻塞时间。仿真实验和算法间隙分析表明,所提算法能够快速获得较好的近优解。
To improve the cooperating operation ability between different equipment, based on the container operating system using tandem-40 crane and dual-cycle operation, a novel three-stage hybrid flow shop problem was derived. The first and third stages contained many batching machines and non-batching machines, and the second stage con- tained non-batching machines. Buffer did not exist between adjacent stages, and the job families such as importing containers and exporting containers successively moved through first stage, second stage and third stage. The mini- mum makespan time was used as objective function to build mixed integer linear programming model for the pro- posed problem. For reducing the setup time between adjacent jobs at second stage and the blocking time between ad- jacent jobs at other stages, the cooperating algorithm was designed, which constructed the route of every job in three- stage hybrid flow shop based on the changes of equipment state and batch priority. The simulation results and algorithm gap showed that the designed algorithm could obtain better solution quality within acceptable computational time.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2014年第2期407-413,共7页
Computer Integrated Manufacturing Systems
基金
国家自然科学基金资助项目(51175388
71372202)~~
关键词
混合流水车间
批处理机
工件族
混合整数规划模型
协同算法
hybrid flow shop
batching machines
job families
mixed integer programming model
cooperating al-gorithm
