A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Se...A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.展开更多
Operating Theatre is the centre of the hospital management＇s efforts. It constitutes the most expensive sector with more than 10% of the intended operating budget of the hospital. To reduce the costs while maintainin...Operating Theatre is the centre of the hospital management＇s efforts. It constitutes the most expensive sector with more than 10% of the intended operating budget of the hospital. To reduce the costs while maintaining a good quality of care, one of the solutions is to improve the existent planning and scheduling methods by improving the services and surgical specialty coordination or finding the best estimation of surgical case durations. The other solution is to construct an effective surgical case plan and schedule. The operating theatre planning and scheduling is the two important steps, which aim to make a surgical case programming with an objective of obtaining a realizable and efficient surgical case schedule. This paper focuses on the first step, the operating theatre planning problem. Two planning methods are introduced and compared. Real data of a Belgian university hospital ＂Tivoli＂ are used for the experiments.展开更多
基金Supported by the National Natural Science Foundation of China (61174040, 61104178)the Fundamental Research Funds for the Central Universities
文摘A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.
基金part of thoughts of the HRP2(Hospitals:Grouping,Sharing and Piloting)project which involves French laboratories hospitals which was sponsored by the Region Rhne-Alpes.It has been realized in the framework of a research project fulfilled in the Belgian laboratory MAAD(Applied Mathematics Decision-making Aid)with the cooperation of a Belgian Hospital"Tivoli".The original version was presented on ICSSSM’06.
文摘Operating Theatre is the centre of the hospital management＇s efforts. It constitutes the most expensive sector with more than 10% of the intended operating budget of the hospital. To reduce the costs while maintaining a good quality of care, one of the solutions is to improve the existent planning and scheduling methods by improving the services and surgical specialty coordination or finding the best estimation of surgical case durations. The other solution is to construct an effective surgical case plan and schedule. The operating theatre planning and scheduling is the two important steps, which aim to make a surgical case programming with an objective of obtaining a realizable and efficient surgical case schedule. This paper focuses on the first step, the operating theatre planning problem. Two planning methods are introduced and compared. Real data of a Belgian university hospital ＂Tivoli＂ are used for the experiments.
