The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Bookmark and Share
NP-Hardness of Some Special Cases of the Three-Machine Flow-Shop Problem
Pages: 43-49
Year: Issue:  1

Keyword:  schedulingflow-shopNP-hardness;
Abstract: In this paper, we investigate the computational complexity of some special cases of the three-machine flow-shop problem to minimize the makespan. NP-hardness is estab-lished for each of the following cases: all jobs require the same processing time on the second machine; all jobs require the same processing time on the first machine and the last machine; each job has at least one zero operation; each job contains a missing operation.
Related Articles
No related articles found