A new algorithm is proposed for the flexible manufacturing system (FMS) scheduling problem in this paper. The proposed algorithm is a heuristic based on filtered beam search. It considers the machines and automated gu...A new algorithm is proposed for the flexible manufacturing system (FMS) scheduling problem in this paper. The proposed algorithm is a heuristic based on filtered beam search. It considers the machines and automated guided vehicle (AGV) as the primary resources. It utilizes system constraints and related manufacturing and processing information to generate machines and AGV schedules. The generated schedules can be an entire scheduling horizon as well as various lengths of scheduling periods. The proposed algorithm is also compared with other well-known dispatching rules-based FMS scheduling. The results indicate that the beam search algorithm is a simple, valid and promising algorithm that deserves further research in FMS scheduling field.展开更多
To improve the efficiency of operating rooms, reduce the hospital＇ s costs and improve the level of service qualities, a scheduling method is presented based on a filtered-beam-search-based algo- rithm. Firstly, a sc...To improve the efficiency of operating rooms, reduce the hospital＇ s costs and improve the level of service qualities, a scheduling method is presented based on a filtered-beam-search-based algo- rithm. Firstly, a scheduling problem domain is described. Mathematical programming models are al- so set up with an objective function of minimizing related costs of the system. On the basis of the de= scriptions mentioned above, a solving policy of generating feasible scheduling solutions is estab- lished. Combining with the speeific constraints of operation theatres, a filtered-beam-search-based algorithm is put forward to solve scheduling problems. Finally, simulation experiments are designed. The performance of the proposed algorithm is evaluated and compared with that of other approaches through simulations. Results indicate that the proposed algorithm can reduce costs, and are of prac- ticality and effectiveness.展开更多
文摘A new algorithm is proposed for the flexible manufacturing system (FMS) scheduling problem in this paper. The proposed algorithm is a heuristic based on filtered beam search. It considers the machines and automated guided vehicle (AGV) as the primary resources. It utilizes system constraints and related manufacturing and processing information to generate machines and AGV schedules. The generated schedules can be an entire scheduling horizon as well as various lengths of scheduling periods. The proposed algorithm is also compared with other well-known dispatching rules-based FMS scheduling. The results indicate that the beam search algorithm is a simple, valid and promising algorithm that deserves further research in FMS scheduling field.
基金Supported by the National Natural Science Foundation of China(No.61273035,71471135)
文摘To improve the efficiency of operating rooms, reduce the hospital＇ s costs and improve the level of service qualities, a scheduling method is presented based on a filtered-beam-search-based algo- rithm. Firstly, a scheduling problem domain is described. Mathematical programming models are al- so set up with an objective function of minimizing related costs of the system. On the basis of the de= scriptions mentioned above, a solving policy of generating feasible scheduling solutions is estab- lished. Combining with the speeific constraints of operation theatres, a filtered-beam-search-based algorithm is put forward to solve scheduling problems. Finally, simulation experiments are designed. The performance of the proposed algorithm is evaluated and compared with that of other approaches through simulations. Results indicate that the proposed algorithm can reduce costs, and are of prac- ticality and effectiveness.
