Date of Award

Fall 2009

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Mechanical & Aerospace Engineering

Program/Concentration

Mechanical Engineering

Committee Director

Han P. Bao

Committee Member

Gene Hou

Committee Member

Miltiadis Kotinis

Call Number for Print

Special Collections; LD4331.E56 B86 2009

Abstract

The major objective of this thesis topic is to study the challenging research subject of job shop scheduling with the intent of optimizing the makespan. The job - shop scheduling problem is one of the hardest combinatorial optimization problems. The main aim of scheduling is an efficient allocation of shared resources like machines, operators or both over time for competing activities.

This research focuses on developing a model for optimizing job shop scheduling problem using genetic algorithm and the Giffler Thompson (priority dispatching rule) technique. Considering different parameters, the model comes up with an appropriate way to schedule the tasks for a job shop in order to minimize the makespan. The model leads to a method of finding out the optimal makespan for a job shop problem by taking into consideration various constraints like the availability of machines, availability of operators, and the possibility of processing back a particular job on the same machine.

Rights

In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).

DOI

10.25777/e9s0-w525

Share

COinS