COMPUTATIONAL TECHNIQUES FOR SCHEDULING PROBLEMS WITH DEFERRAL COSTS.

Abstract

A class of scheduling problems involving deferral costs has been formulated by McNaughton, who has described a simple method of solution for the linear, single-processor case. In this report dynamic programming and linear programming techniques are applied to nonlinear and multiple-processor problems. A dynamic programming solution of the nonlinear, single-processor problem is possible, proveded the number of jobs is small. Transportation methods of linear programming can be used to solve large nonlinear, multiple-processor problems, provided the processing times for the jobs are equal. Approximate and/or partial solutions are possible for other cases. (Author)

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1964
Accession Number
AD0603525

Entities

People

  • E. L. Lawler

Organizations

  • University of Michigan

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Dynamic Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Scheduling (Production)
  • Systems Science
  • Transportation

Fields of Study

  • Mathematics

Readers

  • Operations Research