An improved mathematical model for a two agent scheduling problem in a two-machine flow shop

Rashed Sahraeian | Mohammad Hasan Ahmadi Darani

---

URL :   http://research.shahed.ac.ir/WSR/WebPages/Report/PaperView.aspx?PaperID=116689
Date :  2019/07/12
Publish in :    کنفرانس بين‌المللي مهندسي صنايع و مديريت صنايع


Keywords :Two-agent scheduling; Two-machine flow shop; MIP model

Abstract :

---

This paper addresses a two-agent scheduling problem on a two-machine flow shop. The objective is to minimize the total tardiness of the first agent jobs in the circumstance that no tardy job is allowed for the second agent. This problem has investigated in the literature, and a branch-and-bound algorithm and some meta-heuristic developed to solve it. In this study, first, a mixed integer mathematical programming (MIP) model is developed and then improve the efficiency of this model by using of some optimal solution properties. Experimental results show that the MIP model outperforms the branch and bound algorithm in efficiency by a significant margin and the improved MIP model reduced running time about 37.9 percentages