Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems |
| |
| Authors: | Yasin Unlu Scott J Mason |
| |
| Affiliation: | 1. Department of Business Administration and Economics, Bielefeld University, Universitaetsstrasse 25, Bielefeld 33501, Germany;2. College of Business Administration, The University of Alabama in Huntsville, Huntsville, Al 35899, USA;3. 40476 Duesseldorf, Germany;1. Jacobs University, Bremen, Germany;2. Kühne Logistics University, Hamburg, Germany |
| |
| Abstract: | Mixed integer programming (MIP) formulations for scheduling problems can be classified based on the decision variables upon which they rely. In this paper, four different MIP formulations based on four different types of decision variables are presented for various parallel machine scheduling problems. The goal of this research is to identify promising optimization formulation paradigms that can subsequently be used to either (1) solve larger practical scheduling problems of interest to optimality and/or (2) be used to establish tighter lower solution bounds for those under study. We present the computational results and discuss formulation efficacy for total weighted completion time and maximum completion time problems for the identical parallel machine case. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
