Back to results
University of Illinois at Urbana-Champaign
The Single Machine Problem to Minimize Maximum Lateness
Abstract
dc:descriptionThis thesis addresses the problem of sequencing n jobs on one machine so as to minimize the maximum lateness when the jobs may have unequal ready times, processing times, and due dates and pre-emption is not permitted (the n/l/r(,i) (GREATERTHEQ) O/L(,max)) problem. The objective is to improve the efficiency of solution procedures for problems that have a significant number of jobs.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mechanical Engineering
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2014
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Larson, Raymond Edward
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (UMI)AAI8108574
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/67029