This paper studies the hybrid flow-shop scheduling problem with no-wait restrictions. The production process consists of two machine centers, one has a single machine and the other has more than one parallel machine....This paper studies the hybrid flow-shop scheduling problem with no-wait restrictions. The production process consists of two machine centers, one has a single machine and the other has more than one parallel machine. A greedy heuristic named least deviation algorithm is designed and its worst case performance is analyzed. Computational results are also given to show the algorithm's average performance compared with some other algorithms. The least deviation algorithm outperforms the others in most cases tested here, and it is of low computational complexity and is easy to carry out,thus it is of favorable application value.展开更多
There are a variety of joint job production and transportation scheduling problems that arise in modern manufacturing systems.In this paper,we study one of such problems that arises in a flowshop environment where the...There are a variety of joint job production and transportation scheduling problems that arise in modern manufacturing systems.In this paper,we study one of such problems that arises in a flowshop environment where there are two processing stages and a single transporter that is available to deliver the finished jobs from the first stage to the second.There is a single machine in the first stage and two parallel machines in the second stage.The transporter can carry only one job in each shipment.Each job is first processed on the single machine at stage one,then transported to and processed on one of the two parallel machines at stage two.The objective is to minimize the makespan,i.e.,the completion time of the last job in the second stage.Since this problem is strongly NP-hard,we propose a fast heuristic and show that the heuristic has a worst-case bound of 5/2.We also conduct1 numerical experiments to evaluate the average performance of this heuristic.展开更多
Aiming at the flexible flowshop group scheduling problem,taking sequence dependent setup time and machine skipping into account, a mathematical model for minimizing makespan is established,and a hybrid differential ev...Aiming at the flexible flowshop group scheduling problem,taking sequence dependent setup time and machine skipping into account, a mathematical model for minimizing makespan is established,and a hybrid differential evolution( HDE) algorithm based on greedy constructive procedure( GCP) is proposed,which combines differential evolution( DE) with tabu search( TS). DE is applied to generating the elite individuals of population,while TS is used for finding the optimal value by making perturbation in selected elite individuals. A lower bounding technique is developed to evaluate the quality of proposed algorithm. Experimental results verify the effectiveness and feasibility of proposed algorithm.展开更多
基金Supported by the National Natural Science Foundationof China( No. 6 990 40 0 7)
文摘This paper studies the hybrid flow-shop scheduling problem with no-wait restrictions. The production process consists of two machine centers, one has a single machine and the other has more than one parallel machine. A greedy heuristic named least deviation algorithm is designed and its worst case performance is analyzed. Computational results are also given to show the algorithm's average performance compared with some other algorithms. The least deviation algorithm outperforms the others in most cases tested here, and it is of low computational complexity and is easy to carry out,thus it is of favorable application value.
基金The research was supported by the National Natural Science Foundation of China Grants(No.11301327).
文摘There are a variety of joint job production and transportation scheduling problems that arise in modern manufacturing systems.In this paper,we study one of such problems that arises in a flowshop environment where there are two processing stages and a single transporter that is available to deliver the finished jobs from the first stage to the second.There is a single machine in the first stage and two parallel machines in the second stage.The transporter can carry only one job in each shipment.Each job is first processed on the single machine at stage one,then transported to and processed on one of the two parallel machines at stage two.The objective is to minimize the makespan,i.e.,the completion time of the last job in the second stage.Since this problem is strongly NP-hard,we propose a fast heuristic and show that the heuristic has a worst-case bound of 5/2.We also conduct1 numerical experiments to evaluate the average performance of this heuristic.
基金Shanghai Municipal Natural Science Foundation of China(No.10ZR1431700)
文摘Aiming at the flexible flowshop group scheduling problem,taking sequence dependent setup time and machine skipping into account, a mathematical model for minimizing makespan is established,and a hybrid differential evolution( HDE) algorithm based on greedy constructive procedure( GCP) is proposed,which combines differential evolution( DE) with tabu search( TS). DE is applied to generating the elite individuals of population,while TS is used for finding the optimal value by making perturbation in selected elite individuals. A lower bounding technique is developed to evaluate the quality of proposed algorithm. Experimental results verify the effectiveness and feasibility of proposed algorithm.
