http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Application of the genetic algorithm for global scheduling and a single machine scheduling problem with periodic maintenance and semiresumable jobs
Additionally, a special case of the problem is presented
and a scheduling model for an actual industrial job shop are
compared to the scheduling procedure currently in use by the
developed and combined to provide a search algorithm which
emphasis being on genetic algorithms. A genetic algorithm
finds good schedules for the job shop. This algorithm is
have been applied to this problem are discussed with the
here is the job shop scheduling problem where the objective
is to minimize the makespan. Local search techniques which
maintenance, an additional setup is necessary before
management of the modeled shop, and results are presented.
may occur. This special case is proved to be NP-hard, and a
periodic maintenance. Additionally, if a job is not
problem is proved to be NP-complete in the strong sense.
processed until completion before the machine is stopped for
processing on the job may be resumed. In this thesis, this
pseudopolynomial time dynamic programming algorithm to solve
The first problem consists of minimizing the total completion
the special case is presented. The second problem considered
This thesis considers two different scheduling problems
time of jobs scheduled on a single machine that must undergo
where only two production periods and one maintenance period
"Major subject: Industrial Engineering".
Issued also on microfiche from Lange Micrographics.
Includes bibliographical references: pages 58-60.