Comparisons of three mixed integer programming models for parallel machine scheduling

Abstract

Translate Article

Based on several existing literatures that use mixed integer programming (MIP) to solve parallel machine scheduling problems, this study tests and compares three MIP models. Each order has its own ready date, due date and processing time. The completion time of the order cannot over the its due date. If not, penalties for tardiness will occur. Formulation 1 used in immediate-precedence variables [1]. Formulation 2 is an improved version of immediate-precedence variables original proposed by [2]. Formulation 3 used linear ordering variables[1]. The results reveal that Formulation 2 has better computational performance than other does.