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) linear ordering variables and (4) assignment and positional date variables. The objective functions that are studied in this paper are total weighted completion time, maximum lateness, number of tardy jobs and total weighted tardiness.
Download count: 0
- Partial requirement for: Ph.D., Arizona State University, 2012Note typethesis
- Includes bibliographical referencesNote typebibliography
- Field of study: Industrial engineering