Network Models for Production Scheduling Problems with Convex Cost and Batch Processing.

Abstract

This paper considers a class of production scheduling problems which can be modeled as network flow problems. The problems are addressed under the assumption that production occurs in batches. We also require that the cost function be convex and separable. The model applies for a number of well known production scheduling problems and will handle multiple products and multiple facilities. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1976
Accession Number
ADA031005

Entities

People

  • H. Donald Ratliff

Organizations

  • University of Florida

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Batch Processing
  • Contracts
  • Engineering
  • Industrial Engineering
  • Inventory
  • Management Planning And Control
  • Military Research
  • Production
  • Production Engineering
  • Scheduling (Production)
  • Security
  • Systems Engineering

Readers

  • Calculus or Mathematical Analysis
  • Industrial Economics
  • Parallel and Distributed Computing.