default search action
Shijin Wang 0002
Person information
- affiliation: Fuzhou University, School of Economics and Management, Department of Management Science and Engineering, China
- affiliation: Tongji University, Department of Management Science and Engineering, Shanghai, China
- affiliation (PhD 2009): Shanghai Jiaotong University, Department of Industrial Engineering and Management, School of Mechanical Engineering, China
- affiliation (2007 - 2008): University of Cincinnati, center for intelligent maintenance system, IMS, OH, USA
- affiliation (former): Zhejiang University of Technology, Department of Industrial Engineering, Hangzhou, China
Other persons with the same name
- Shijin Wang — disambiguation page
- Shijin Wang 0001
— iFLYTEK AI Research (Hebei), Langfang, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j40]Shijin Wang
A bay design problem in less-than-unit-load production warehouse. Comput. Oper. Res. 171: 106792 (2024) - 2023
- [j39]Shijin Wang, Hanyu Zhang:
A matheuristic for flowshop scheduling with batch processing machines in textile manufacturing. Appl. Soft Comput. 145: 110594 (2023) - [j38]Shijin Wang, Ruochen Wu, Feng Chu, Jianbo Yu:
An exact decomposition method for unrelated parallel machine scheduling with order acceptance and setup times. Comput. Ind. Eng. 175: 108899 (2023) - [j37]Shijin Wang, Hanyu Zhang, Feng Chu, Li Yu
A relax-and-fix method for clothes inventory balancing scheduling problem. Int. J. Prod. Res. 61(20): 7085-7104 (2023) - [j36]Jianbo Yu, Shijin Li, Xing Liu, Yanfeng Gao, Shijin Wang, Changhui Liu
Dynamic convolutional gated recurrent unit attention auto-encoder for feature learning and fault detection in dynamic industrial processes. Int. J. Prod. Res. 61(21): 7434-7452 (2023) - [c7]Shijin Wang, Haoran Li, Feng Chu:
A Relax-and-fix Heuristic for Multiple Team Formation Problem. ICNSC 2023: 1-6 - [c6]Shijin Wang, Hanyu Zhang, Feng Chu, Kan Fang:
Simultaneous Production and Transportation Problem to Minimize the Total Cost of Waiting Time and Tardiness. ICNSC 2023: 1-6 - 2022
- [j35]Shijin Wang, Ying Lu, Feng Chu
Scheduling with divisible jobs and subcontracting option. Comput. Oper. Res. 145: 105850 (2022) - [j34]Peng Hu, Feng Chu, Ming Liu, Shijin Wang, Peng Wu:
An integrated approach for a new flexible multi-product disassembly line balancing problem. Comput. Oper. Res. 148: 105932 (2022) - [j33]Shijin Wang, Ruochen Wu, Feng Chu
Unrelated parallel machine scheduling problem with special controllable processing times and setups. Comput. Oper. Res. 148: 105990 (2022) - [j32]E. Zhang, Feng Chu
Approximation approach for robust vessel fleet deployment problem with ambiguous demands. J. Comb. Optim. 44(4): 2180-2194 (2022) - [j31]Jianbo Yu
Sparse one-dimensional convolutional neural network-based feature learning for fault detection and diagnosis in multivariable manufacturing processes. Neural Comput. Appl. 34(6): 4343-4366 (2022) - [j30]Shijin Wang
A Decomposition-Based Heuristic Method for Inventory Routing Problem. IEEE Trans. Intell. Transp. Syst. 23(10): 18352-18360 (2022) - 2021
- [j29]Jianbo Yu, Shijin Li, Zongli Shen, Shijin Wang, Changhui Liu, Qingfeng Li
Deep transfer Wasserstein adversarial network for wafer map defect recognition. Comput. Ind. Eng. 161: 107679 (2021) - [j28]Jianbo Yu, Zongli Shen, Shijin Wang:
Wafer map defect recognition based on deep transfer learning-based densely connected convolutional network and deep forest. Eng. Appl. Artif. Intell. 105: 104387 (2021) - [j27]Kan Fang
A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions. Eur. J. Oper. Res. 291(1): 128-146 (2021) - [j26]Chengyi Zhang, Jianbo Yu
Fault detection and recognition of multivariate process based on feature learning of one-dimensional convolutional neural network and stacked denoised autoencoder. Int. J. Prod. Res. 59(8): 2426-2449 (2021) - [j25]Shijin Wang, Wenli Cui:
Approximation algorithms for the min-max regret identical parallel machine scheduling problem with outsourcing and uncertain processing time. Int. J. Prod. Res. 59(15): 4579-4592 (2021) - [j24]Shijin Wang, Wenli Cui, Feng Chu
The interval min-max regret knapsack packing-delivery problem. Int. J. Prod. Res. 59(18): 5661-5677 (2021) - [j23]Jianbo Yu
Multichannel one-dimensional convolutional neural network-based feature learning for fault diagnosis of industrial processes. Neural Comput. Appl. 33(8): 3085-3104 (2021) - 2020
- [j22]Shijin Wang, Ruochen Wu, Feng Chu
An improved formulation and efficient heuristics for the discrete parallel-machine makespan ScheLoc problem. Comput. Ind. Eng. 140: 106238 (2020) - [j21]Shumei Chen, Jianbo Yu
Monitoring of complex profiles based on deep stacked denoising autoencoders. Comput. Ind. Eng. 143: 106402 (2020) - [j20]Shijin Wang, Wenli Cui, Feng Chu
Robust (min-max regret) single machine scheduling with interval processing times and total tardiness criterion. Comput. Ind. Eng. 149: 106838 (2020) - [j19]Shijin Wang, Ruochen Wu, Feng Chu
Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job. Comput. Oper. Res. 118: 104918 (2020) - [j18]Shijin Wang, Xiaodong Wang
An energy-efficient two-stage hybrid flow shop scheduling problem in a glass production. Int. J. Prod. Res. 58(8): 2283-2314 (2020) - [j17]Shijin Wang, Ruochen Wu, Feng Chu
Variable neighborhood search-based methods for integrated hybrid flow shop scheduling with distribution. Soft Comput. 24(12): 8917-8936 (2020) - [c5]Shijin Wang, Ting Hu:
A game-theory based parking pricing policy*. IEEM 2020: 230-234 - [c4]Shijin Wang, Jiaolong Wang:
Trade-terms Based Pricing Method for Export Commodity. IEEM 2020: 670-674
2010 – 2019
- 2019
- [j16]Shijin Wang, Ying Lu:
A branch and price algorithm for single-machine completion time variance. Comput. Oper. Res. 109: 188-199 (2019) - [j15]Jianbo Yu
Stacked denoising autoencoder-based feature learning for out-of-control source recognition in multivariate manufacturing process. Qual. Reliab. Eng. Int. 35(1): 204-223 (2019) - 2018
- [j14]Shijin Wang, Zhanguo Zhu, Kan Fang
Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs. Int. J. Prod. Res. 56(9): 3173-3187 (2018) - [c3]Ming Liu, Rongfan Liu, Shijin Wang, Feng Chu
Container truck scheduling problem under empty container return policy. ICNSC 2018: 1-6 - 2017
- [j13]Ming Liu, Shijin Wang, Feifeng Zheng, Chengbin Chu:
Algorithms for the joint multitasking scheduling and common due date assignment problem. Int. J. Prod. Res. 55(20): 6052-6066 (2017) - 2016
- [j12]Ming Liu, Shijin Wang, Feng Chu
Some complexity results and an efficient algorithm for quay crane scheduling problem. Discret. Math. Algorithms Appl. 8(4): 1650058:1-1650058:19 (2016) - [j11]Shijin Wang, Ming Liu
Two-machine flow shop scheduling integrated with preventive maintenance planning. Int. J. Syst. Sci. 47(3): 672-690 (2016) - [c2]Ming Liu, Lujun Xu, Shijin Wang, Chengbin Chu:
Efficient algorithm for quay crane scheduling with arbitrary precedence constraint. WODES 2016: 57-62 - 2015
- [c1]Ming Liu, Shijin Wang, Chengbin Chu, Feifeng Zheng:
A branch-and-price framework for the general double-cycling problem with internal-reshuffles. ICNSC 2015: 304-308 - 2013
- [j10]Shijin Wang, Jianbo Yu, Edzel Lapira, Jay Lee
A modified support vector data description based novelty detection approach for machinery components. Appl. Soft Comput. 13(2): 1193-1205 (2013) - [j9]Shijin Wang, Ming Liu
A heuristic method for two-stage hybrid flow shop with dedicated machines. Comput. Oper. Res. 40(1): 438-450 (2013) - [j8]Shijin Wang, Ming Liu
A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Comput. Oper. Res. 40(4): 1064-1075 (2013) - [j7]Ming Liu
Approximation algorithms for parallel machine scheduling with linear deterioration. Theor. Comput. Sci. 497: 108-111 (2013) - 2012
- [j6]Jinshi Zhao, Yongrui Duan, Shijin Wang, Jiazhen Huo:
Coordinated Drop Shipping Commitment Contract in Dual-Distribution Channel Supply Chain. J. Electron. Commer. Organ. 10(4): 19-30 (2012) - [j5]Ming Liu
Optimal algorithms for online single machine scheduling with deteriorating jobs. Theor. Comput. Sci. 445: 75-81 (2012) - 2010
- [j4]Shijin Wang, Jianbo Yu
An effective heuristic for flexible job-shop scheduling problem with maintenance activities. Comput. Ind. Eng. 59(3): 436-447 (2010)
2000 – 2009
- 2009
- [j3]Jianbo Yu
Using Minimum Quantization Error chart for the monitoring of process states in multivariate manufacturing processes. Comput. Ind. Eng. 57(4): 1300-1312 (2009) - 2008
- [j2]Jianbo Yu
Evolving artificial neural networks using an improved PSO and DPSO. Neurocomputing 71(4-6): 1054-1060 (2008) - 2007
- [j1]Jianbo Yu
An Improved Particle Swarm Optimization for Evolving Feedforward Artificial Neural Networks. Neural Process. Lett. 26(3): 217-231 (2007)
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-12-02 21:26 CET 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: