Improved MILP models for two-machine flowshop with batch processing machines |
| |
| Authors: | Ching-Jong Liao Li-Man Liao |
| |
| Institution: | aDepartment of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan;bDepartment of Industrial Engineering and Management, National Chin-Yi University of Technology, Taichung, Taiwan |
| |
| Abstract: | In this paper, we consider the problem of scheduling jobs in a flowshop with two batch processing machines such that the makespan is minimized. Batch processing machines are frequently encountered in many industrial environments such as heat treatment operations in a steel foundry and chemical processes performed in tanks or kilns. Improved Mixed Integer Linear Programming (MILP) models are presented for the flowshop problem with unlimited or zero intermediate storage. An MILP-based heuristic is also developed for the problem. Computational experiments show that the new MILP models can significantly improve the original ones. Also, the heuristic can obtain the optimal solutions for all the test problem instances. |
| |
| Keywords: | Batch processing Scheduling Flow shop Mathematical formulation |
| 本文献已被 ScienceDirect 等数据库收录！ |
