Flexible Assembly Job-Shop Scheduling With Sequence-Dependent Setup Times and Part Sharing in a Dynamic Environment: Constraint Programming Model, Mixed-Integer Programming Model, and Dispatching Rules
研究了动态制造环境下的柔性装配作业车间调度问题，允许零件共享和序列依赖准备时间，对比了约束规划、混合整数规划和分派规则的效果，发现约束规划最优，分派规则中最早完成时间规则最佳。
This paper studies the flexible assembly job-shop scheduling problem in a dynamic manufacturing environment, which is an exension of job-shop scheduling with incorporation of serveral types of flexibilies and integration of an assembly stage. Each product is assembled from several parts with nonlinear process plans with operations involving alternative machines. Setup times are sequence dependent and serparately considered from processing times. Part sharing is fully allowed such that they can be used for the assembly of any possible product, rather than being preassociated to a specfic product. We employ constraint programming and mixed-integer linear programming to formulate the problem. Besides, several dispatching rules with machine feedback machanism are developped. Experimental studies are conducted based on test case problems with different scales and complexities. It is found that constraint programming is the most efficacious approach, whose solution fitness outperforms mixed-integer linear programming as well as all dispatching rules in both static and dynamic cases. On the other hand, dispatching rules are simple to implement, among which the “earliest completion time” rule is the most favourable. A real-time scheduling/rescheduling system has been constructed for the implementation of the proposed approaches to solve practical problems in production.