default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShunji Tanaka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Shunji Tanaka
, Mohamed Elwakil, Amr B. Eltawil:
The parallel stack loading problem of minimizing the exact number of relocations. Comput. Oper. Res. 169: 106712 (2024)- 2023
- [j20]Bo Jin, Shunji Tanaka:
An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules. Eur. J. Oper. Res. 304(2): 494-514 (2023) - 2022
- [j19]Shunji Tanaka, Stefan Voß:
An exact approach to the restricted block relocation problem based on a new integer programming formulation. Eur. J. Oper. Res. 296(2): 485-503 (2022) - 2020
- [j18]André Hottung, Shunji Tanaka, Kevin Tierney:
Deep learning assisted heuristic tree search for the container pre-marshalling problem. Comput. Oper. Res. 113 (2020) - [c12]Yulun Wu, Shunji Tanaka:
A Mixed-integer Programming Approach to Group Control of Elevator Systems with Destination Hall Call Registration. IEEM 2020: 26-31
2010 – 2019
- 2019
- [j17]Shunji Tanaka, Kevin Tierney, Consuelo Parreño-Torres, Ramón Alvarez-Valdés, Rubén Ruiz:
A branch and bound approach for large pre-marshalling problems. Eur. J. Oper. Res. 278(1): 211-225 (2019) - [j16]Shunji Tanaka, Stefan Voß:
An exact algorithm for the block relocation problem with a stowage plan. Eur. J. Oper. Res. 279(3): 767-781 (2019) - 2018
- [j15]Shunji Tanaka, Fumitaka Mizuno:
An exact algorithm for the unrestricted block relocation problem. Comput. Oper. Res. 95: 12-31 (2018) - [j14]Shunji Tanaka, Kevin Tierney:
Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm. Eur. J. Oper. Res. 264(1): 165-180 (2018) - 2017
- [i1]André Hottung, Shunji Tanaka, Kevin Tierney:
Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem. CoRR abs/1709.09972 (2017) - 2016
- [j13]Boris Detienne, Ruslan Sadykov, Shunji Tanaka:
The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation. Eur. J. Oper. Res. 252(3): 750-760 (2016) - [j12]Shunji Tanaka, Kenta Takii:
A Faster Branch-and-Bound Algorithm for the Block Relocation Problem. IEEE Trans Autom. Sci. Eng. 13(1): 181-190 (2016) - 2015
- [c11]Shunji Tanaka, Fumitaka Mizuno:
Dominance properties for the unrestricted block relocation problem and their application to a branch-and-bound algorithm. CASE 2015: 509-514 - [c10]Shunji Tanaka:
Extension of the dominance properties for the unrestricted block relocation problem. IEEM 2015: 224-229 - 2014
- [j11]Shunji Tanaka, Tomohiko Mitani, Yoshio Ebihara:
An Efficient Beamforming Algorithm for Large-Scale Phased Arrays with Lossy Digital Phase Shifters. IEICE Trans. Commun. 97-B(4): 783-790 (2014) - [j10]Shunji Tanaka:
Improved Exact Enumerative Algorithmsfor the Planted ($l$, $d$)-Motif Search Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 11(2): 361-374 (2014) - [c9]Shunji Tanaka, Kenta Takii:
A faster branch-and-bound algorithm for the block relocation problem. CASE 2014: 7-12 - 2013
- [j9]Shunji Tanaka, Mituhiko Araki:
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. Comput. Oper. Res. 40(1): 344-352 (2013) - [j8]Shunji Tanaka, Shun Sato:
An exact algorithm for the precedence-constrained single-machine scheduling problem. Eur. J. Oper. Res. 229(2): 345-352 (2013) - [c8]Shunji Tanaka, Takuto Miyoshi, Daiki Hoshino:
A Mathematical Model of the Car Operation Problem in Multi-car Elevator Systems. SMC 2013: 228-233 - 2012
- [j7]Shunji Tanaka:
A heuristic algorithm based on Lagrangian relaxation for the closest string problem. Comput. Oper. Res. 39(3): 709-717 (2012) - [j6]Shunji Tanaka, Shuji Fujikuma:
A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time. J. Sched. 15(3): 347-361 (2012) - 2011
- [c7]Shunji Tanaka:
A unified approach for the scheduling problem with rejection. CASE 2011: 369-374 - 2010
- [c6]Shunji Tanaka:
A heuristic algorithm based on Lagrangian relaxation for the closest string problem. SMC 2010: 2780-2786
2000 – 2009
- 2009
- [j5]Shunji Tanaka, Shuji Fujikuma, Mituhiko Araki:
An exact algorithm for single-machine scheduling without machine idle time. J. Sched. 12(6): 575-593 (2009) - [c5]Mitsuyo Hashida, Shunji Tanaka, Haruhiro Katayose:
Mixtract: A directable musical expression system. ACII 2009: 1-6 - 2008
- [c4]Shunji Tanaka, Shuji Fujikuma:
An efficient exact algorithm for general single-machine scheduling with machine idle time. CASE 2008: 371-376 - 2005
- [j4]Shunji Tanaka, Yukihiro Uraguchi, Mituhiko Araki:
Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: Part I. Formulation and simulations. Eur. J. Oper. Res. 167(2): 550-573 (2005) - [j3]Shunji Tanaka, Yukihiro Uraguchi, Mituhiko Araki:
Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: Part II. The solution algorithm. Eur. J. Oper. Res. 167(2): 574-587 (2005) - [c3]Shunji Tanaka, Fumitaka Jouo, Mituhiko Araki:
Decomposition of the single-machine total tardiness problem with a precedence constraint. SMC 2005: 716-721 - 2004
- [c2]Shunji Tanaka, Yasuyuki Innami, Mituhiko Araki:
A study on objective functions for dynamic operation optimization of a single-car elevator system with destination hall call registration. SMC (7) 2004: 6274-6279 - 2003
- [c1]Shunji Tanaka, Taku Sasaki, Mituhiko Araki:
A branch-and-bound algorithm for the single-machine weighted earliness-tardiness scheduling problem with job independent weights. SMC 2003: 1571-1577 - 2002
- [j2]Shunji Tanaka, Tomomichi Hagiwara, Mituhiko Araki:
A Study on the Optimal Cost for the Hinfty Problem of Discrete Linear Periodically Time-Varying Systems. SIAM J. Control. Optim. 41(2): 362-379 (2002)
1980 – 1989
- 1987
- [j1]Hidenori Umeno, Shunji Tanaka:
New Methods for Realizing Plural Near-Native Performance Virtual Machines. IEEE Trans. Computers 36(9): 1076-1087 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
