Publication Date

2015

Document Type

Dissertation/Thesis

First Advisor

Moraga, Reinaldo J.

Degree Name

M.S. (Master of Science)

Department

Department of Industrial and Systems Engineering

LCSH

Operations research||Industrial engineering||Heuristic programming||Production scheduling--Mathematical models||Production control--Mathematical models

Abstract

A single machine includes loading and unloading areas for each job processed in it in a way that loading and unloading operations could be performed while the machine is running. This leads to minimizing the completion of the jobs with lowest machine idle time. This design requires a special kind of scheduling technique for jobs to ensure the accomplishment of those objectives if the processing, loading, and unloading times are varying. The machine is modeled as a flow shop with blocking constraint. This research focuses on finding a solution to schedule this special case of flow shop as a flow shop of more than two machines with the main objective of minimizing jobs maximum completion time (makespan) which is an NP-hard problem.

Comments

Advisors: Reinaldo J. Moraga.||Committee members: Omar A. Ghrayeb; Christine Nguyen.

Extent

67 pages

Language

eng

Publisher

Northern Illinois University

Rights Statement

In Copyright

Rights Statement 2

NIU theses are protected by copyright. They may be viewed from Huskie Commons for any purpose, but reproduction or distribution in any format is prohibited without the written permission of the authors.

Media Type

Text

Share

COinS