Improved MILP models for two-machine flowshop with batch processing machines

Authors:
Ching-Jong Liao;Li-Man Liao
Affiliations:
Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan;Department of Industrial Engineering and Management, National Chin-Yi University of Technology, Taichung, Taiwan
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2008

Citing 2
Cited 1

A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size

Mathematical and Computer Modelling: An International Journal
Mixed integer formulation to minimize makespan in a flow shop with batch processing machines

Mathematical and Computer Modelling: An International Journal

Tabu search heuristic for two-machine flowshop with batch processing machines

Computers and Industrial Engineering

Quantified Score

Hi-index	0.98

Visualization

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.