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: | Khowala, Ketan (Author) |
---|---|
Format: | Doctoral Thesis |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/2286/R.I.14756 |
Similar Items
-
Greedy-Based Non-Dominated Sorting Genetic Algorithm III for Optimizing Single-Machine Scheduling Problem With Interfering Jobs
by: Chen-Yang Cheng, et al.
Published: (2020-01-01) -
A Set Union Based Formulation for Course Scheduling and Timetabling
by: Bukenberger, Jesse Paul
Published: (2014) -
Artificial Immune Systems Applied to Job Shop Scheduling
by: Bondal, Akshata A.
Published: (2008) -
Mixed integer lineal programming model to schedule flexible job-shop systems in make to order environments
by: Sebastián Enrique Ortiz Gaitán, et al.
Published: (2017-07-01) -
A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling
by: Boberg, Jessika
Published: (2017)