Optimal Scheduling With Flexible Resources

Abstract

In this project, the PI has developed an efficient optimization framework, the Nested Partitions (NP) method, for difficult combinatorial optimization problems (see publications). In particular, the Job Shop Total Inventory Minimization Problem (JSTIMP) and the Multicommodity Distribution System Design (MDSD) Problem were investigated. It has been demonstrated that the NP framework can be integrated with many well-known optimization algorithms/methods to provide hybrid algorithms for efficiently solving many large-scale combinatorial optimization problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 31, 2003
Accession Number
ADA419887

Entities

People

  • Leyuan Shi

Organizations

  • University of Wisconsin–Madison

Tags

Communities of Interest

  • Energy and Power Technologies
  • Ground and Sea Platforms
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Data Centers
  • Evolutionary Algorithms
  • Heuristic Methods
  • Industrial Engineering
  • Information Processing
  • Information Systems
  • Integer Programming
  • Linear Programming
  • Manufacturing
  • Mathematical Programming
  • Operating Systems
  • Operations Research
  • Optimization
  • Supply Chain
  • Systems Engineering

Readers

  • Distributed Systems and Data Platform Development
  • Operations Research