rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Application of the genetic algorithm for global scheduling and a single machine scheduling problem with periodic maintenance and semiresumable jobs
  name:
    name part: Graves, Gregory Howard.
    role:
      role term: creator
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: xx
    date issued: 1998
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    form: remote
    extent: ix, 89 leaves : illustrations ; 28 cm.
  abstract: Additionally, a special case of the problem is presented
  abstract: and a scheduling model for an actual industrial job shop are
  abstract: compared to the scheduling procedure currently in use by the
  abstract: developed and combined to provide a search algorithm which
  abstract: emphasis being on genetic algorithms. A genetic algorithm
  abstract: finds good schedules for the job shop. This algorithm is
  abstract: have been applied to this problem are discussed with the
  abstract: here is the job shop scheduling problem where the objective
  abstract: in industrial settings.
  abstract: is to minimize the makespan. Local search techniques which
  abstract: maintenance, an additional setup is necessary before
  abstract: management of the modeled shop, and results are presented.
  abstract: may occur. This special case is proved to be NP-hard, and a
  abstract: periodic maintenance. Additionally, if a job is not
  abstract: problem is proved to be NP-complete in the strong sense.
  abstract: processed until completion before the machine is stopped for
  abstract: processing on the job may be resumed. In this thesis, this
  abstract: pseudopolynomial time dynamic programming algorithm to solve
  abstract: The first problem consists of minimizing the total completion
  abstract: the special case is presented. The second problem considered
  abstract: This thesis considers two different scheduling problems
  abstract: time of jobs scheduled on a single machine that must undergo
  abstract: where only two production periods and one maintenance period
  note: by Gregory Howard Graves.
  note: "Major subject: Industrial Engineering".
  note: Vita.
  note: Also available online.
  note: Issued also on microfiche from Lange Micrographics.
  note: M.S. Texas A&M University 1998.
  note: Includes bibliographical references: pages 58-60.
  subject:
    topic: Major industrial engineering
  identifier: https://hdl.handle.net/1969.1/ETD-TAMU-1998-THESIS-G73
  related item:
    location:
      url: https://hdl.handle.net/1969.1/ETD-TAMU-1998-THESIS-G73
  record info:
    record content source: TXA
    record creation date: 981116
    record change date: 20220103134733.0
    record identifier: in00001446793