Permutation Type Schedules on a Single Machine under Cost Criteria.

Abstract

Optimal permutation type schedules are obtained for a class of n jobs one machine type problems using as criteria i. the total processing cost, ii. the total deferral cost, and iii. the total processing and deferral cost. The set of seven models developed include cases when the machine deteriorates with usage, and when resetting of the machine is possible at the completion of each job. Particular attention is devoted to accounting for the time value of money, an important factor in the case of large tasks extending over prolonged periods of time such as construction projects. Use is made of a theorem in underlying the structural equivalence of all the models considered. Finally, an application related to a modular configuration is discussed. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1976
Accession Number
ADA032071

Entities

People

  • B. D. Sivazlian

Organizations

  • University of Florida

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Contracts
  • Engineering
  • Industrial Engineering
  • Literature Surveys
  • Machines
  • Maintenance
  • Military Research
  • Operations Research
  • Parallel Processors
  • Permutations
  • Production
  • Scheduling (Production)
  • Sequences
  • Systems Engineering
  • Theorems

Readers

  • Circadian Sleep-Wake Regulation and Chronobiology
  • Life Cycle Cost Analysis
  • Mathematical Modeling and Probability Theory.