Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration |
| |
Authors: | Lixin Tang Peng Liu |
| |
Institution: | The Logistics Institute, Northeastern University, Shenyang 110004, China |
| |
Abstract: | This paper considers two scheduling problems for a two-machine flowshop where a single machine is followed by a batching machine. The first problem is that there is a transporter to carry the jobs between machines. The second problem is that there are deteriorating jobs to be processed on the single machine. For the first problem with minimizing the makespan, we formulate it as a mixed integer programming model and then prove that it is strongly NP-hard. A heuristic algorithm is proposed for solving this problem and its worst case performance is analyzed. The computational experiments are carried out and the numerical results show that the heuristic algorithm is effective. For the second problem, we derive the optimal algorithms with polynomial time for minimizing the makespan, the total completion time and the maximum lateness, respectively. |
| |
Keywords: | Flowshop scheduling Batching machine Transportation Deterioration Heuristic |
本文献已被 ScienceDirect 等数据库收录! |
|