Skip to main navigation Skip to search Skip to main content

Dynamic scheduling for minimal flow time and maximum reliability

  • Xiaoxia Wang
  • , N. Eva Wu
  • State University of New York Binghamton University

Research output: Contribution to journalConference articlepeer-review

Abstract

This paper presents a scheduling algorithm applied to a circular manufacture assembly with redundant facilities. The task is to switch on and off facilities in a manner that minimizes job failure cost and job flow time for a given job production order. The dynamic nature of the scheduling problem is dictated by the aging of the facilities. An example is given to show how our scheduling algorithm results in different system reliability, failure cost and job flow time under differently weighed cost functionals.

Original languageEnglish
Pages (from-to)1005-1009
Number of pages5
JournalIFAC-PapersOnLine
Volume36
Issue number5
DOIs
StatePublished - 2003
Event5th IFAC Symposium on Fault Detection, Supervision and Safety of Technical Processes, Safeprocess 2003 - Washington, United States
Duration: Jun 9 1997Jun 11 1997

Keywords

  • Dynamic programming
  • Failure cost
  • Flow time
  • Reliability
  • Scheduling

Fingerprint

Dive into the research topics of 'Dynamic scheduling for minimal flow time and maximum reliability'. Together they form a unique fingerprint.

Cite this