Advertisement

Sequencing Research and the Industrial Scheduling Problem

  • S. S. Panwalkar
  • R. A. Dudek
  • M. L. Smith
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 86)

Abstract

Types of industrial scheduling problems were investigated by personal visits to plants and by questionnaires mailed to scheduling departments. Information on problem sizes, job flow, optimization criteria and job similarity was obtained. Results indicate that most of the present procedures in theoretical research cannot handle average industrial problems. Also most commonly used objective criteria differ from industrial goals. There is a definite need for better communication between sequencing researchers and scheduling practioners.

Keywords

Flow Shop Total Response Schedule Decision Total Processing Time Machine Idle Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Prunzel, J. F., “Setup Times and Setup Costs in Sequencing Problems,” Unpublished Master’s Thesis, Texas Tech University, 1972.Google Scholar
  2. 2.
    Smith, M. L., “A Critical Analysis of Flow Shop Sequencing,” Unpublished Doctoral Dissertation, Texas Tech University, 1968.Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1973

Authors and Affiliations

  • S. S. Panwalkar
    • 1
  • R. A. Dudek
    • 1
  • M. L. Smith
    • 1
  1. 1.Texas Tech UniversityLubbockUSA

Personalised recommendations