0
One Problem of the Total Flow-Time of Two Machine Open-Shop

Excerpt

The total flow-time problem of two machine open-shop is NP-hard in strong sense. The problem laying down restriction on machine dependent processing times has been researched in this paper. An explicit solution is designed and proved for the above problem when the numbers of jobs satisfy certain condition for the problem and some properties are proved.

  • Abstract
  • Keywords
  • Introduction
  • The Total Flow-Time of Problem(1.3) and Some Properties of Problem(1.2)
  • The Optimal Schedule of Problem (1.2) for n>m
  • References
Topics: Machinery

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In