Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings[Type 1 Only]
IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2023-05-10 14:30
[Invited Talk] Reallocation Problems with Minimum Completion Time
Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.) COMP2023-1
Abstract (in Japanese) (See Japanese page) 
(in English) Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logistics, and transportation science. In this paper, we introduce the reallocation problem that models the scheduling in which products are with fixed cost (e.g., transition time), non-fungible, and reallocated among warehouses in parallel, and comprehensively study the complexity of the problem under various settings of the transition time, product size, and capacities. We show that the problem can be solved in polynomial time for a fundamental setting where the product size and transition time are both uniform. We also show that the feasibility of the problem is NP-complete even for little more general settings, which implies that no polynomial-time algorithm constructs a feasible schedule of the problem unless P=NP. We then consider to solve the problem by relaxing capacity constraints, which we call the capacity augmentation, and derive a reallocation schedule feasible with the augmentation such that the completion time is at most the optimal of the original problem. When the warehouse capacity is sufficiently large, we design constant-factor approximation algorithms. We also show the relationship between the reallocation problem and the bin packing problem when the warehouse and carry-in capacities are sufficiently large.
Keyword (in Japanese) (See Japanese page) 
(in English) Algorithm / NP-hardness / Capacity augmentation / Approximation / Scheduling / Bin packing / /  
Reference Info. IEICE Tech. Rep., vol. 123, no. 12, COMP2023-1, p. 1, May 2023.
Paper # COMP2023-1 
Date of Issue 2023-05-03 (COMP) 
ISSN Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2023-1

Conference Information
Committee COMP IPSJ-AL  
Conference Date 2023-05-10 - 2023-05-11 
Place (in Japanese) (See Japanese page) 
Place (in English) Hokkaido University 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Theoretical Computer Science, etc 
Paper Information
Registration To COMP 
Conference Code 2023-05-COMP-AL 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Reallocation Problems with Minimum Completion Time 
Sub Title (in English)  
Keyword(1) Algorithm  
Keyword(2) NP-hardness  
Keyword(3) Capacity augmentation  
Keyword(4) Approximation  
Keyword(5) Scheduling  
Keyword(6) Bin packing  
Keyword(7)  
Keyword(8)  
1st Author's Name Toshimasa Ishii  
1st Author's Affiliation Hokkaido University (Hokkaido Univ.)
2nd Author's Name Jun Kawahara  
2nd Author's Affiliation Kyoto University (Kyoto Univ.)
3rd Author's Name Kazuhisa Makino  
3rd Author's Affiliation Kyoto University (Kyoto Univ.)
4th Author's Name Hirotaka Ono  
4th Author's Affiliation Nagoya University (Nagoya Univ.)
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2023-05-10 14:30:00 
Presentation Time 60 minutes 
Registration for COMP 
Paper # COMP2023-1 
Volume (vol) vol.123 
Number (no) no.12 
Page p.1 
#Pages 1 
Date of Issue 2023-05-03 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]

(Line Height for English Pages: 1)

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