-
Previous Article
Bond pricing formulas for Markov-modulated affine term structure models
- JIMO Home
- This Issue
-
Next Article
Branching improved Deep Q Networks for solving pursuit-evasion strategy solution of spacecraft
Parallel-machine scheduling in shared manufacturing
1. | School of Management and E-Business, Contemporary Business and Trade Research Center, Zhejiang Gongshang University, Hangzhou 310018, Zhejiang, P. R. China |
2. | Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong |
We consider parallel-machine scheduling in the context of shared manufacturing where each job has a machine set to which it can be assigned for processing. Such a set is called the processing set. In the shared manufacturing setting, a job can be assigned not only to certain machines for processing, but can also be processed on the remaining machines at a certain cost. Compared with traditional scheduling with job rejection, the scheduling model under study embraces the notion of sustainable manufacturing. Showing that the problem is NP-hard, we develop a fully polynomial-time approximation scheme to solve the problem when the number of machines is fixed.
References:
[1] |
S. Adhau, M. L. Mittal and A. Mittal,
A multi-agent system for decentralized multi-project scheduling with resource transfers, International Journal of Production Economics, 146 (2013), 646-661.
doi: 10.1016/j.ijpe.2013.08.013. |
[2] |
P. A. Albinsson and B. Y. Perera,
Alternative marketplaces in the 21st century: Building community through sharing events, Journal of Consumer Behaviour, 11 (2012), 303-315.
doi: 10.1002/cb.1389. |
[3] |
S. Amaro, L. Andreu and S. Huang,
Millenials' intentions to book on Airbnb, Current Issues in Tourism, 22 (2019), 2284-2298.
doi: 10.1080/13683500.2018.1448368. |
[4] |
S. J. Barnes and J. Mattsson,
Building tribal communities in the collaborative economy: An innovation framework, Prometheus, 34 (2016), 95-113.
doi: 10.1080/08109028.2017.1279875. |
[5] |
T. Becker and H. Stern,
Impact of resource sharing in manufacturing on logistical key figures, Procedia CIRP, 41 (2016), 579-584.
doi: 10.1016/j.procir.2015.12.037. |
[6] |
R. Belk,
Why not share rather than own?, Annals of the American Academy of Political and Social Science, 611 (2007), 126-140.
doi: 10.1177/0002716206298483. |
[7] |
R. Belk, Sharing, Journal of Consumer Research, 36 (2010), 715-734. Google Scholar |
[8] |
Y. Benkler,
Sharing nicely: On shareable goods and the emergence of sharing as a modality of economic production, The Yale Law Journal, 114 (2004), 273-358.
doi: 10.2307/4135731. |
[9] |
E. Brandt, A vision for shared manufacturing, Mechanical Engineering, 112 (1990), 52-55. Google Scholar |
[10] |
F. Chasin, M. von Hoffen, M. Cramer and M. Matzner,
Peer-to-peer sharing and collaborative consumption platforms: A taxonomy and a reproducible analysis, Information Systems and E-Business Management, 16 (2018), 293-325.
doi: 10.1007/s10257-017-0357-8. |
[11] |
L. Epstein and A. Levin,
Scheduling with processing set restrictions: PTAS results for several variants, International Journal of Production Economics, 133 (2011), 586-595.
doi: 10.1016/j.ijpe.2011.04.024. |
[12] |
R. L. Graham, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan,
Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5 (1979), 287-326.
doi: 10.1016/S0167-5060(08)70356-X. |
[13] |
J. Hamari, M. Sjöklint and A. Ukkonen, The sharing economy: Why people participate in collaborative consumption, Journal of the Association for Information Science and Technology, 67 (2016), 2047-2059. Google Scholar |
[14] |
J. He, J. Zhang and X. Gu,
Research on sharing manufacturing in Chinese manufacturing industry, International Journal of Advanced Manufacturing Technology, 104 (2019), 463-476.
doi: 10.1007/s00170-019-03886-w. |
[15] |
H. Heinrichs,
Sharing economy: A potential new pathway to sustainability, Gaia-ecological Perspectives for Science and Society, 22 (2013), 228-231.
doi: 10.14512/gaia.22.4.5. |
[16] |
Y. Huo and J. Y. T. Leung,
Parallel machine scheduling with nested processing set restrictions, European Journal of Operational Research, 204 (2010), 229-236.
doi: 10.1016/j.ejor.2009.10.025. |
[17] |
K. N. Irvine, L. O'Brien, N. Ravenscroft, N. Cooper, M. Everard, I. Fazey, M. S. Reed and J. O. Kenter,
Ecosystem services and the idea of shared values, Ecosystem Services, 21 (2016), 184-193.
doi: 10.1016/j.ecoser.2016.07.001. |
[18] |
M. Ji and T. C. E. Cheng,
Parallel-machine scheduling with simple linear deterioration to minimize total completion time, European Journal of Operational Research, 188 (2008), 342-347.
doi: 10.1016/j.ejor.2007.04.050. |
[19] |
M. Ji and T. C. E. Cheng,
Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan, European Journal of Operational Research, 202 (2010), 90-98.
doi: 10.1016/j.ejor.2009.05.021. |
[20] |
M. Ji, X. Tang, X. Zhang and T. C. E. Cheng, Machine scheduling with deteriorating jobs and DeJong's learning effect, Computers and Industrial Engineering, 91 (2016), 42-47. Google Scholar |
[21] |
M. Ji, Q. Yang, D. Yao and T. C. E. Cheng,
Single-machine batch scheduling of linear deteriorating jobs, Theoretical Computer Science, 580 (2015), 36-49.
doi: 10.1016/j.tcs.2015.02.025. |
[22] |
B. Jiang and L. Tian, Collaborative consumption: Strategic and economic implications of product sharing, Management Science, 64 (2018), 1171-1188. Google Scholar |
[23] |
P. Jiang and P. Li,
Shared factory: A new production node for social manufacturing in the context of sharing economy, Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 234 (2020), 285-294.
doi: 10.1177/0954405419863220. |
[24] |
M. Y. Kovalyov and W. Kubiak, A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs, Journal of Heuristics, 4 (1998), 287-297. Google Scholar |
[25] |
M. Y. Kovalyov and W. Kubiak,
A fully polynomial approximation scheme for the weighted earliness-tardiness problem, Operations Research, 47 (1999), 757-761.
doi: 10.1287/opre.47.5.757. |
[26] |
H. Kurdi, E. Aloboud, S. Alhassan and E. T. Alotaibi,
An algorithm for handling starvation and resource rejection in public clouds, Procedia Computer Science, 34 (2014), 242-248.
doi: 10.1016/j.procs.2014.07.018. |
[27] |
Z. W. Y. Lee, T. K. H. Chan, M. S. Balaji and A. Y.-L. Chong,
Why people participate in the sharing economy: An empirical investigation of Uber, Internet Research, 28 (2018), 829-850.
doi: 10.1108/IntR-01-2017-0037. |
[28] |
C. P. Lamberton and R. L. Rose, When is ours better than mine? A framework for understanding and altering participation in commercial sharing systems, Social Science Electronic Publishing, 76 (2011), 109-125. Google Scholar |
[29] |
J. Y.-T. Leung and C.-L. Li,
Scheduling with processing set restrictions: A survey, International Journal of Production Economics, 116 (2008), 251-262.
doi: 10.1016/j.ijpe.2008.09.003. |
[30] |
J. Y.-T. Leung and C.-L. Li,
Scheduling with processing set restrictions: A literature update, International Journal of Production Economics, 175 (2016), 1-11.
doi: 10.1016/j.ijpe.2014.09.038. |
[31] |
J. Y.-T. Leung and C. T. Ng,
Fast approximation algorithms for uniform machine scheduling with processing set restrictions, European Journal of Operational Research, 260 (2017), 507-513.
doi: 10.1016/j.ejor.2017.01.013. |
[32] |
K. Li, T. Zhou, B. Liu and H. Li,
A multi-agent system for sharing distributed manufacturing resources, Expert Systems with Applications, 99 (2018), 32-43.
doi: 10.1016/j.eswa.2018.01.027. |
[33] |
S. Li,
Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, European Journal of Operational Research, 260 (2017), 12-20.
doi: 10.1016/j.ejor.2016.11.044. |
[34] |
A. M. Munar and J. K. S. Jacobsen,
Motivations for sharing tourism experiences through social media, Tourism Management, 43 (2014), 46-54.
doi: 10.1016/j.tourman.2014.01.012. |
[35] |
J. Ou, X. Zhong and X. Qi,
Scheduling parallel machines with inclusive processing set restrictions and job rejection, Naval Research Logistics, 63 (2016), 667-681.
doi: 10.1002/nav.21728. |
[36] |
A. Paagman, M. Tate, E. Furtmueller and J. de Bloom,
An integrative literature review and empirical validation of motives for introducing shared services in government organizations, International Journal of Information Management, 35 (2015), 110-123.
doi: 10.1016/j.ijinfomgt.2014.10.006. |
[37] |
M. E. Porter and M. R. Kramer, Creating shared value. Harvard Business Review, Harvard Business Review, 89 (2011), 62-77. Google Scholar |
[38] |
J. A. Price,
Sharing: The integration of intimate economies, Anthropologica (New Series), 17 (1975), 3-27.
doi: 10.2307/25604933. |
[39] |
H. Ryu, M. Basu and O. Saito,
What and how are we sharing? A systematic review of the sharing paradigm and practices, Sustainability Science, 14 (2019), 515-527.
doi: 10.1007/s11625-018-0638-2. |
[40] |
D. Shabtay, N. Gaspar and M. Kaspi,
A survey on offline scheduling with rejection, Journal of Scheduling, 16 (2013), 3-28.
doi: 10.1007/s10951-012-0303-z. |
[41] |
S. A. Slotnick,
Order acceptance and scheduling: A taxonomy and review, European Journal of Operational Research, 212 (2011), 1-11.
doi: 10.1016/j.ejor.2010.09.042. |
[42] |
S. Wang and R. A. Noe,
Knowledge sharing: A review and directions for future research, Human Resource Management Review, 20 (2010), 115-131.
doi: 10.1016/j.hrmr.2009.10.001. |
[43] |
C. H. Yu, K. Doppler, C. B. Ribeiro and O. Tirkkonen, Resource sharing optimization for device-to-device communication underlaying cellular networks, IEEE Transactions on Wireless Communications, 10 (2011), 2752-2763. Google Scholar |
show all references
References:
[1] |
S. Adhau, M. L. Mittal and A. Mittal,
A multi-agent system for decentralized multi-project scheduling with resource transfers, International Journal of Production Economics, 146 (2013), 646-661.
doi: 10.1016/j.ijpe.2013.08.013. |
[2] |
P. A. Albinsson and B. Y. Perera,
Alternative marketplaces in the 21st century: Building community through sharing events, Journal of Consumer Behaviour, 11 (2012), 303-315.
doi: 10.1002/cb.1389. |
[3] |
S. Amaro, L. Andreu and S. Huang,
Millenials' intentions to book on Airbnb, Current Issues in Tourism, 22 (2019), 2284-2298.
doi: 10.1080/13683500.2018.1448368. |
[4] |
S. J. Barnes and J. Mattsson,
Building tribal communities in the collaborative economy: An innovation framework, Prometheus, 34 (2016), 95-113.
doi: 10.1080/08109028.2017.1279875. |
[5] |
T. Becker and H. Stern,
Impact of resource sharing in manufacturing on logistical key figures, Procedia CIRP, 41 (2016), 579-584.
doi: 10.1016/j.procir.2015.12.037. |
[6] |
R. Belk,
Why not share rather than own?, Annals of the American Academy of Political and Social Science, 611 (2007), 126-140.
doi: 10.1177/0002716206298483. |
[7] |
R. Belk, Sharing, Journal of Consumer Research, 36 (2010), 715-734. Google Scholar |
[8] |
Y. Benkler,
Sharing nicely: On shareable goods and the emergence of sharing as a modality of economic production, The Yale Law Journal, 114 (2004), 273-358.
doi: 10.2307/4135731. |
[9] |
E. Brandt, A vision for shared manufacturing, Mechanical Engineering, 112 (1990), 52-55. Google Scholar |
[10] |
F. Chasin, M. von Hoffen, M. Cramer and M. Matzner,
Peer-to-peer sharing and collaborative consumption platforms: A taxonomy and a reproducible analysis, Information Systems and E-Business Management, 16 (2018), 293-325.
doi: 10.1007/s10257-017-0357-8. |
[11] |
L. Epstein and A. Levin,
Scheduling with processing set restrictions: PTAS results for several variants, International Journal of Production Economics, 133 (2011), 586-595.
doi: 10.1016/j.ijpe.2011.04.024. |
[12] |
R. L. Graham, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan,
Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5 (1979), 287-326.
doi: 10.1016/S0167-5060(08)70356-X. |
[13] |
J. Hamari, M. Sjöklint and A. Ukkonen, The sharing economy: Why people participate in collaborative consumption, Journal of the Association for Information Science and Technology, 67 (2016), 2047-2059. Google Scholar |
[14] |
J. He, J. Zhang and X. Gu,
Research on sharing manufacturing in Chinese manufacturing industry, International Journal of Advanced Manufacturing Technology, 104 (2019), 463-476.
doi: 10.1007/s00170-019-03886-w. |
[15] |
H. Heinrichs,
Sharing economy: A potential new pathway to sustainability, Gaia-ecological Perspectives for Science and Society, 22 (2013), 228-231.
doi: 10.14512/gaia.22.4.5. |
[16] |
Y. Huo and J. Y. T. Leung,
Parallel machine scheduling with nested processing set restrictions, European Journal of Operational Research, 204 (2010), 229-236.
doi: 10.1016/j.ejor.2009.10.025. |
[17] |
K. N. Irvine, L. O'Brien, N. Ravenscroft, N. Cooper, M. Everard, I. Fazey, M. S. Reed and J. O. Kenter,
Ecosystem services and the idea of shared values, Ecosystem Services, 21 (2016), 184-193.
doi: 10.1016/j.ecoser.2016.07.001. |
[18] |
M. Ji and T. C. E. Cheng,
Parallel-machine scheduling with simple linear deterioration to minimize total completion time, European Journal of Operational Research, 188 (2008), 342-347.
doi: 10.1016/j.ejor.2007.04.050. |
[19] |
M. Ji and T. C. E. Cheng,
Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan, European Journal of Operational Research, 202 (2010), 90-98.
doi: 10.1016/j.ejor.2009.05.021. |
[20] |
M. Ji, X. Tang, X. Zhang and T. C. E. Cheng, Machine scheduling with deteriorating jobs and DeJong's learning effect, Computers and Industrial Engineering, 91 (2016), 42-47. Google Scholar |
[21] |
M. Ji, Q. Yang, D. Yao and T. C. E. Cheng,
Single-machine batch scheduling of linear deteriorating jobs, Theoretical Computer Science, 580 (2015), 36-49.
doi: 10.1016/j.tcs.2015.02.025. |
[22] |
B. Jiang and L. Tian, Collaborative consumption: Strategic and economic implications of product sharing, Management Science, 64 (2018), 1171-1188. Google Scholar |
[23] |
P. Jiang and P. Li,
Shared factory: A new production node for social manufacturing in the context of sharing economy, Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 234 (2020), 285-294.
doi: 10.1177/0954405419863220. |
[24] |
M. Y. Kovalyov and W. Kubiak, A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs, Journal of Heuristics, 4 (1998), 287-297. Google Scholar |
[25] |
M. Y. Kovalyov and W. Kubiak,
A fully polynomial approximation scheme for the weighted earliness-tardiness problem, Operations Research, 47 (1999), 757-761.
doi: 10.1287/opre.47.5.757. |
[26] |
H. Kurdi, E. Aloboud, S. Alhassan and E. T. Alotaibi,
An algorithm for handling starvation and resource rejection in public clouds, Procedia Computer Science, 34 (2014), 242-248.
doi: 10.1016/j.procs.2014.07.018. |
[27] |
Z. W. Y. Lee, T. K. H. Chan, M. S. Balaji and A. Y.-L. Chong,
Why people participate in the sharing economy: An empirical investigation of Uber, Internet Research, 28 (2018), 829-850.
doi: 10.1108/IntR-01-2017-0037. |
[28] |
C. P. Lamberton and R. L. Rose, When is ours better than mine? A framework for understanding and altering participation in commercial sharing systems, Social Science Electronic Publishing, 76 (2011), 109-125. Google Scholar |
[29] |
J. Y.-T. Leung and C.-L. Li,
Scheduling with processing set restrictions: A survey, International Journal of Production Economics, 116 (2008), 251-262.
doi: 10.1016/j.ijpe.2008.09.003. |
[30] |
J. Y.-T. Leung and C.-L. Li,
Scheduling with processing set restrictions: A literature update, International Journal of Production Economics, 175 (2016), 1-11.
doi: 10.1016/j.ijpe.2014.09.038. |
[31] |
J. Y.-T. Leung and C. T. Ng,
Fast approximation algorithms for uniform machine scheduling with processing set restrictions, European Journal of Operational Research, 260 (2017), 507-513.
doi: 10.1016/j.ejor.2017.01.013. |
[32] |
K. Li, T. Zhou, B. Liu and H. Li,
A multi-agent system for sharing distributed manufacturing resources, Expert Systems with Applications, 99 (2018), 32-43.
doi: 10.1016/j.eswa.2018.01.027. |
[33] |
S. Li,
Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, European Journal of Operational Research, 260 (2017), 12-20.
doi: 10.1016/j.ejor.2016.11.044. |
[34] |
A. M. Munar and J. K. S. Jacobsen,
Motivations for sharing tourism experiences through social media, Tourism Management, 43 (2014), 46-54.
doi: 10.1016/j.tourman.2014.01.012. |
[35] |
J. Ou, X. Zhong and X. Qi,
Scheduling parallel machines with inclusive processing set restrictions and job rejection, Naval Research Logistics, 63 (2016), 667-681.
doi: 10.1002/nav.21728. |
[36] |
A. Paagman, M. Tate, E. Furtmueller and J. de Bloom,
An integrative literature review and empirical validation of motives for introducing shared services in government organizations, International Journal of Information Management, 35 (2015), 110-123.
doi: 10.1016/j.ijinfomgt.2014.10.006. |
[37] |
M. E. Porter and M. R. Kramer, Creating shared value. Harvard Business Review, Harvard Business Review, 89 (2011), 62-77. Google Scholar |
[38] |
J. A. Price,
Sharing: The integration of intimate economies, Anthropologica (New Series), 17 (1975), 3-27.
doi: 10.2307/25604933. |
[39] |
H. Ryu, M. Basu and O. Saito,
What and how are we sharing? A systematic review of the sharing paradigm and practices, Sustainability Science, 14 (2019), 515-527.
doi: 10.1007/s11625-018-0638-2. |
[40] |
D. Shabtay, N. Gaspar and M. Kaspi,
A survey on offline scheduling with rejection, Journal of Scheduling, 16 (2013), 3-28.
doi: 10.1007/s10951-012-0303-z. |
[41] |
S. A. Slotnick,
Order acceptance and scheduling: A taxonomy and review, European Journal of Operational Research, 212 (2011), 1-11.
doi: 10.1016/j.ejor.2010.09.042. |
[42] |
S. Wang and R. A. Noe,
Knowledge sharing: A review and directions for future research, Human Resource Management Review, 20 (2010), 115-131.
doi: 10.1016/j.hrmr.2009.10.001. |
[43] |
C. H. Yu, K. Doppler, C. B. Ribeiro and O. Tirkkonen, Resource sharing optimization for device-to-device communication underlaying cellular networks, IEEE Transactions on Wireless Communications, 10 (2011), 2752-2763. Google Scholar |
[1] |
Yicheng Liu, Yipeng Chen, Jun Wu, Xiao Wang. Periodic consensus in network systems with general distributed processing delays. Networks & Heterogeneous Media, 2020 doi: 10.3934/nhm.2021002 |
[2] |
Onur Şimşek, O. Erhun Kundakcioglu. Cost of fairness in agent scheduling for contact centers. Journal of Industrial & Management Optimization, 2020 doi: 10.3934/jimo.2021001 |
[3] |
Simone Fiori. Error-based control systems on Riemannian state manifolds: Properties of the principal pushforward map associated to parallel transport. Mathematical Control & Related Fields, 2021, 11 (1) : 143-167. doi: 10.3934/mcrf.2020031 |
[4] |
Longxiang Fang, Narayanaswamy Balakrishnan, Wenyu Huang. Stochastic comparisons of parallel systems with scale proportional hazards components equipped with starting devices. Journal of Industrial & Management Optimization, 2020 doi: 10.3934/jimo.2021004 |
[5] |
Guo Zhou, Yongquan Zhou, Ruxin Zhao. Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem. Journal of Industrial & Management Optimization, 2021, 17 (2) : 533-548. doi: 10.3934/jimo.2019122 |
[6] |
Huu-Quang Nguyen, Ya-Chi Chu, Ruey-Lin Sheu. On the convexity for the range set of two quadratic functions. Journal of Industrial & Management Optimization, 2020 doi: 10.3934/jimo.2020169 |
[7] |
Sumit Kumar Debnath, Pantelimon Stǎnicǎ, Nibedita Kundu, Tanmay Choudhury. Secure and efficient multiparty private set intersection cardinality. Advances in Mathematics of Communications, 2021, 15 (2) : 365-386. doi: 10.3934/amc.2020071 |
[8] |
Yasmine Cherfaoui, Mustapha Moulaï. Biobjective optimization over the efficient set of multiobjective integer programming problem. Journal of Industrial & Management Optimization, 2021, 17 (1) : 117-131. doi: 10.3934/jimo.2019102 |
[9] |
Shasha Hu, Yihong Xu, Yuhan Zhang. Second-Order characterizations for set-valued equilibrium problems with variable ordering structures. Journal of Industrial & Management Optimization, 2020 doi: 10.3934/jimo.2020164 |
[10] |
Wenbin Li, Jianliang Qian. Simultaneously recovering both domain and varying density in inverse gravimetry by efficient level-set methods. Inverse Problems & Imaging, , () : -. doi: 10.3934/ipi.2020073 |
[11] |
Ali Mahmoodirad, Harish Garg, Sadegh Niroomand. Solving fuzzy linear fractional set covering problem by a goal programming based solution approach. Journal of Industrial & Management Optimization, 2020 doi: 10.3934/jimo.2020162 |
[12] |
Lingfeng Li, Shousheng Luo, Xue-Cheng Tai, Jiang Yang. A new variational approach based on level-set function for convex hull problem with outliers. Inverse Problems & Imaging, , () : -. doi: 10.3934/ipi.2020070 |
[13] |
Darko Dimitrov, Hosam Abdo. Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 711-721. doi: 10.3934/dcdss.2019045 |
[14] |
Jingjing Wang, Zaiyun Peng, Zhi Lin, Daqiong Zhou. On the stability of solutions for the generalized vector quasi-equilibrium problems via free-disposal set. Journal of Industrial & Management Optimization, 2021, 17 (2) : 869-887. doi: 10.3934/jimo.2020002 |
[15] |
Peter Frolkovič, Viera Kleinová. A new numerical method for level set motion in normal direction used in optical flow estimation. Discrete & Continuous Dynamical Systems - S, 2021, 14 (3) : 851-863. doi: 10.3934/dcdss.2020347 |
[16] |
Tetsuya Ishiwata, Takeshi Ohtsuka. Numerical analysis of an ODE and a level set methods for evolving spirals by crystalline eikonal-curvature flow. Discrete & Continuous Dynamical Systems - S, 2021, 14 (3) : 893-907. doi: 10.3934/dcdss.2020390 |
[17] |
Yuanfen Xiao. Mean Li-Yorke chaotic set along polynomial sequence with full Hausdorff dimension for $ \beta $-transformation. Discrete & Continuous Dynamical Systems - A, 2021, 41 (2) : 525-536. doi: 10.3934/dcds.2020267 |
[18] |
Duy Phan. Approximate controllability for Navier–Stokes equations in $ \rm3D $ cylinders under Lions boundary conditions by an explicit saturating set. Evolution Equations & Control Theory, 2021, 10 (1) : 199-227. doi: 10.3934/eect.2020062 |
2019 Impact Factor: 1.366
Tools
Article outline
[Back to Top]