Lower Bounds for Evaluating Schedule Performance in Flexible Job Shops

Abstract

In this paper, we are interested in the multiobjective evaluation of the schedule performance in the flexible job shops. The Flexible Job Shop Scheduling Problem (FJSP) is known in the literature as one of the hardest combinatorial optimization problems and presents many objectives to be optimized. In this way, we aim to determine a set of lower bounds for certain criteria which will be able to characterize the feasible solutions of such a problem. The studied criteria are the following: the makespan, the workload of the critical machine, and the total workload of all the machines. Our study relates to the determination of a practical method in order to evaluate the representative performance of the production system.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 2002
Accession Number
ADA519839

Entities

People

  • Imed Kacem
  • Pierre Borne
  • Slim Hammadi

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Artificial Intelligence
  • Availability
  • Classification
  • Contracts
  • Information Operations
  • Instructions
  • Intelligent Systems
  • Job Shop Scheduling
  • Literature
  • Monitoring
  • Optimization
  • Production
  • Scheduling (Production)
  • Security
  • Workload
  • Workshops

Fields of Study

  • Computer science

Readers

  • Instructional Design and Training Evaluation.
  • Operations Research