Complexity and Polynomial Time Algorithms of the 3TMF Machine Scheduling Problem

摘要：

In the classic scheduling theory, it’s widely assumed that a task can be processed by only one processor at a time. With the development of technology, this assumption is not so widely accepted. This paper introduces a new machine scheduling mode-3TMF (it is the abbreviation of two-stage multi-processor flowshop scheduling problem). The problem is proved to be NP-complete, and a few polynomial solvable cases of the problem are discussed.

作者: Lu Xuhua Hu Rong

作者单位: College of Science Wuhan University of Science and Technology Wuhan, China, 430081 College of Management Wuhan University of Science and Technology Wuhan, China, 430081

会议类型: 国际会议

会议名称: 第三届国际脉冲动力系统及应用学术会议

会议地点: 青岛

会议语种:英文

在线出版日期: 2006-07-21（万方平台首次上网日期，不代表论文的发表时间）