Fundamental Concepts in Discrete Optimization as Related to Classes of Scheduling Problems.

Abstract

Work accomplished over the first three years (1972-75) may be summarized as follows: (1) An extensive study of models for optimally scheduling lots of N products on a single processor under various demand process structures. (2) Solution of a problem of scheduling N jobs on parallel processors to minimize a penalty function based on job due dates when there are no precedence relations among jobs. (3) Two studies treating the efficient solution of minimum cost flow problems. (4) Research on methodologies for discrete optimization related to (a) Tree search in methods of implicit enumeration, (b) Circumventing the 'curse of dimensionality' in dynamic programming, and (c) The reduction method of integer programming for a specialized version of the generalized assignment problem. (5) Surveys of past and current research in (a) Scheduling multiple processors, (b) Flow networks, (c) Project planning networks, (d) Basic concepts used in branch-and-bound, and (e) Production planning.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 10, 1978
Accession Number
ADA062129

Entities

People

  • Salah E. Elmaghraby

Organizations

  • North Carolina State University

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Air Force Facilities
  • Algorithms
  • Dynamic Programming
  • Engineering
  • Engineers
  • Flow Network
  • Heuristic Methods
  • Industrial Engineering
  • New York
  • North Carolina
  • Operations Research
  • Optimization
  • Production
  • Production Planning
  • Professional Associations
  • Scheduling (Production)
  • Students

Readers

  • Operations Research
  • Parallel and Distributed Computing.