The use of dynamic networks in scheduling flexible manufacturing systems
Kroll, Dennis Edwards
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/21951
Description
Title
The use of dynamic networks in scheduling flexible manufacturing systems
Author(s)
Kroll, Dennis Edwards
Issue Date
1989
Doctoral Committee Chair(s)
Kumar, K. Ravi
Department of Study
Business Administration, General
Engineering, Industrial
Operations Research
Discipline
Business Administration, General
Engineering, Industrial
Operations Research
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Business Administration, General
Engineering, Industrial
Operations Research
Language
eng
Abstract
Flexible Manufacturing Systems have developed recently to allow companies to compete in a global market. One problem arising from such systems is the optimal scheduling of the jobs through the system. There is much discussion as to what this problem should be, but it is agreed that it is a hard problem.
This thesis deals with the scheduling problem as defined by Stecke as problems concerning the running of an FMS once it has been set up during a planning phase. Numerous techniques have been proposed to solve this problem.
If the problem is static, various queueing models may be used. However, in a dynamic environment these models fail. Mathematical programming models allow for the dynamic environment, but rapidly increase in calculation requirements due to the need for integer answers. Simulation, hierarchical, and expert systems try to address this problem, but don't allow for optimal solutions.
The use of a dynamic network model had been considered in the past, but rejected for various reasons. The thrust of this thesis is that these networks can be used and are a computationally feasible technique for finding optimal solutions to the FMS scheduling problem. In order to develop this concept, the basic dynamic network models originally proposed by Maxwell & Wilson needed to be expanded and modified.
By incorporating the concepts of limited entry queues and micromodels of resources, a dynamic network model of an FMS can be developed and solved by efficient network flow techniques.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.