IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2015-04-23 15:25
Computational Complexity of Generalized Makespan Minimization Problem
Tsunehiko Nagayama, Kunihiko Sadakane (Univ. of Tokyo)
Abstract (in Japanese) (See Japanese page) 
(in English) We generalize the makespan minimization problem on unrelated parallel machines and formulate the generalized makespan minimization problem, which finds an edge cover that minimizes the maximum weighted cost on a weighted graph. We then show that this problem is NP-hard even if the number of different costs on edges is two.
Keyword (in Japanese) (See Japanese page) 
(in English) graph algorithm / computational complexity / edge cover / scheduling problem / / / /  
Reference Info. IEICE Tech. Rep., vol. 115, no. 15, COMP2015-4, pp. 21-25, April 2015.
Paper # COMP2015-4 
Date of Issue 2015-04-16 (COMP) 
ISSN Print edition: ISSN 0913-5685  Online edition: ISSN 2432-6380

Conference Information
Committee COMP  
Conference Date 2015-04-23 - 2015-04-23 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2015-04-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Computational Complexity of Generalized Makespan Minimization Problem 
Sub Title (in English)  
Keyword(1) graph algorithm  
Keyword(2) computational complexity  
Keyword(3) edge cover  
Keyword(4) scheduling problem  
1st Author's Name Tsunehiko Nagayama  
1st Author's Affiliation The University of Tokyo (Univ. of Tokyo)
2nd Author's Name Kunihiko Sadakane  
2nd Author's Affiliation The University of Tokyo (Univ. of Tokyo)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Date Time 2015-04-23 15:25:00 
Presentation Time 20 
Registration for COMP 
Paper # IEICE-COMP2015-4 
Volume (vol) IEICE-115 
Number (no) no.15 
Page pp.21-25 
#Pages IEICE-5 
Date of Issue IEICE-COMP-2015-04-16 

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan