Single Machine Scheduling: Comparison of MIP Formulations and Heuristics for Interfering Job Sets
abstract: This research by studies the computational performance of four different mixed integer programming (MIP) formulations for single machine scheduling problems with varying complexity. These formulations are based on (1) start and completion time variables, (2) time index variables, (3) linea...
Other Authors: | |
---|---|
Format: | Doctoral Thesis |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/2286/R.I.14756 |