Review

Distributed shop scheduling: A comprehensive review on classifications, models and algorithms


  • Received: 04 June 2023 Revised: 05 July 2023 Accepted: 12 July 2023 Published: 20 July 2023
  • In the intelligent manufacturing environment, modern industry is developing at a faster pace, and there is an urgent need for reasonable production scheduling to ensure an organized production order and a dependable production guarantee for enterprises. Additionally, production cooperation between enterprises and different branches of enterprises is increasingly common, and distributed manufacturing has become a prevalent production model. In light of these developments, this paper presents the research background and current state of distributed shop scheduling. It summarizes relevant research on issues that align with the new manufacturing model, explores hot topics and concerns and focuses on the classification of distributed parallel machine scheduling, distributed flow shop scheduling, distributed job shop scheduling and distributed assembly shop scheduling. The paper investigates these scheduling problems in terms of single-objective and multi-objective optimization, as well as processing constraints. It also summarizes the relevant optimization algorithms and their limitations. It also provides an overview of research methods and objects, highlighting the development of solution methods and research trends for new problems. Finally, the paper analyzes future research directions in this field.

    Citation: Jianguo Duan, Mengting Wang, Qinglei Zhang, Jiyun Qin. Distributed shop scheduling: A comprehensive review on classifications, models and algorithms[J]. Mathematical Biosciences and Engineering, 2023, 20(8): 15265-15308. doi: 10.3934/mbe.2023683

    Related Papers:

    [1] Zilong Zhuang, Zhiyao Lu, Zizhao Huang, Chengliang Liu, Wei Qin . A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates. Mathematical Biosciences and Engineering, 2019, 16(5): 4491-4505. doi: 10.3934/mbe.2019224
    [2] Wenqiang Zhang, Chen Li, Mitsuo Gen, Weidong Yang, Zhongwei Zhang, Guohui Zhang . Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem. Mathematical Biosciences and Engineering, 2022, 19(9): 8833-8865. doi: 10.3934/mbe.2022410
    [3] Wenqiang Zhang, Xiaoxiao Zhang, Xinchang Hao, Mitsuo Gen, Guohui Zhang, Weidong Yang . Multi-stage hybrid evolutionary algorithm for multiobjective distributed fuzzy flow-shop scheduling problem. Mathematical Biosciences and Engineering, 2023, 20(3): 4838-4864. doi: 10.3934/mbe.2023224
    [4] Guohui Zhang, Jinghe Sun, Xing Liu, Guodong Wang, Yangyang Yang . Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm. Mathematical Biosciences and Engineering, 2019, 16(3): 1334-1347. doi: 10.3934/mbe.2019065
    [5] Kongfu Hu, Lei Wang, Jingcao Cai, Long Cheng . An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem. Mathematical Biosciences and Engineering, 2023, 20(9): 17407-17427. doi: 10.3934/mbe.2023774
    [6] Shaofeng Yan, Guohui Zhang, Jinghe Sun, Wenqiang Zhang . An improved ant colony optimization for solving the flexible job shop scheduling problem with multiple time constraints. Mathematical Biosciences and Engineering, 2023, 20(4): 7519-7547. doi: 10.3934/mbe.2023325
    [7] Yifan Gu, Hua Xu, Jinfeng Yang, Rui Li . An improved memetic algorithm to solve the energy-efficient distributed flexible job shop scheduling problem with transportation and start-stop constraints. Mathematical Biosciences and Engineering, 2023, 20(12): 21467-21498. doi: 10.3934/mbe.2023950
    [8] Cong Zhao, Na Deng . An actor-critic framework based on deep reinforcement learning for addressing flexible job shop scheduling problems. Mathematical Biosciences and Engineering, 2024, 21(1): 1445-1471. doi: 10.3934/mbe.2024062
    [9] Yafei Li, Yuxi Liu . Multi-airport system flight slot optimization method based on absolute fairness. Mathematical Biosciences and Engineering, 2023, 20(10): 17919-17948. doi: 10.3934/mbe.2023797
    [10] Dan Yang, Zhiqiang Xie, Chunting Zhang . Multi-flexible integrated scheduling algorithm for multi-flexible integrated scheduling problem with setup times. Mathematical Biosciences and Engineering, 2023, 20(6): 9781-9817. doi: 10.3934/mbe.2023429
  • In the intelligent manufacturing environment, modern industry is developing at a faster pace, and there is an urgent need for reasonable production scheduling to ensure an organized production order and a dependable production guarantee for enterprises. Additionally, production cooperation between enterprises and different branches of enterprises is increasingly common, and distributed manufacturing has become a prevalent production model. In light of these developments, this paper presents the research background and current state of distributed shop scheduling. It summarizes relevant research on issues that align with the new manufacturing model, explores hot topics and concerns and focuses on the classification of distributed parallel machine scheduling, distributed flow shop scheduling, distributed job shop scheduling and distributed assembly shop scheduling. The paper investigates these scheduling problems in terms of single-objective and multi-objective optimization, as well as processing constraints. It also summarizes the relevant optimization algorithms and their limitations. It also provides an overview of research methods and objects, highlighting the development of solution methods and research trends for new problems. Finally, the paper analyzes future research directions in this field.



    Since the publication of Bitcoin (BTC) in October 2008, the digital and decentralised currency has attracted the attention of many researchers. BTC is one of the most famous and important cryptocurrencies, and it is based on blockchain technology with cryptology. Its transaction assumes the peer-to-peer (P2P) method. Notably, mining BTC is the most important way to get more coins, and owing to the calculations of a special algorithm, BTC does not depend on any currency institutions for issuance. Instead, it uses a decentralised transaction system and distributed ledger, which combines with many nodes in the BTC internet to record each trade information unit for every node. Besides, it uses cryptology to protect the safety of the decentralised system during BTC transactions. In addition, there are only about 21 million bitcoins that can be mined on the BTC internet. However, owing to the calculation speed now, the BTC system currently releases some BTC to miners every 10 minutes once. Nonetheless, in the future, more precisely by 2140, the number of mining bitcoins will be maximum.

    To study BTC, it is important to understand blockchain technology, which is the core technology of BTC. The technology involves recording a series of trade information units, also called a block, and sending them from one account to another. Besides, every block is encrypted by cryptography, which can effectively protect the transaction information of every block during the process of transmission. As a new method of application of computer technology, blockchain technology includes aspects such as the storage of distributed data, P2P transmission, an encryption algorithm and a consensus mechanism. In addition, blockchains, an essential technology of BTC, has a lot of new advantages in different aspects. For example, a blockchain is a decentralised system, which makes it different from traditional currencies' transaction systems. In a normal system, there is a centre to control and collect all information and data from all transactions. As a result, this characteristic of blockchains can effectively improve the safety of a system since there is no centre in this system and all nodes act as the centre for the whole system. Besides, this aspect enhances the security of the system since every node takes part in recording transaction information and every node can use the distributed ledger to monitor the safety of the decentralised system and avoid tampering by hackers. Therefore, committing crimes in this decentralised system is too difficult amidst a continuous threat from hackers. Furthermore, information transferring in the blockchain is irreversible. In this system, when people trade with others via blockchain technology, the process of the transferring information to the next point cannot be changed again because of BTC's special algorithm. As a result, every trade information unit is stored forever when the information is recorded and verified to the blockchain once. Modification of the database is invalid on a single node unless more than 51% of the nodes can be controlled at the same time in the system. Thus, the stability and reliability of data within the blockchain are extremely high.

    Blockchain systems also tend to be open, but also have privacy. A portion of the data of the blockchain is open to everyone, but the private information of all parties and individual transaction information are encrypted with secret keys. The open attribute of blockchain means that anyone can check and query the data in the blockchain system through the open interface. In this respect, the information of the whole system is highly transparent. More related, consensus-based specifications and protocols are adopted by blockchains, such as a set of open and transparent algorithms. This implies that data can be freely and safely exchanged between all nodes throughout the whole system in a distrustful environment, which makes the trust of people change to the trust of machines, and no artificial intervention can work. Besides, blockchains are also highly effective at preserving anonymity. The rationale is that all transactions between every node follow a fixed algorithm, and that the interaction between the data does not need to be trusted because the program rules in the blockchain will judge whether the activity is effective or not by themselves. This means that the counterparty does not need to let the other party generate trust by revealing its identity, which is very helpful for the accumulation of credit. Hence, the reason why a lot of people focus on BTC is due to such advantages.

    BTC's functions and characteristics make it different from other virtual currencies of online gaming communities. Notably, it is often viewed as a new and creative digital currency with cryptology, which is remarkable in this development of the currency. Due to the specifics of BTC, many people tend to overestimate it. Consequently, the virtual currency market has seen huge growth in a great number of new currencies and the prices of cryptocurrencies, and now people invest more money in cryptocurrencies with a high frequency of transactions. When more people started to focus on cryptocurrencies, their prices rapidly increased over the past several years. During this period, its price has always been up and down, which means it has high volatility. There have been a great number of people whose emotions follows its price. Gradually, BTC has become more likely to be an asset due to this trend, despite its volatility being more frequent than traditional currencies.

    Although financial creativities are conducive to achieving developments in the finance industry, they bring some new problems. New turmoil in the financial markets shows enormous opportunities and challenges for governments, economists, financial institutions and entrepreneurs. For example, BTC improves financial development, but there are a great number of criminals who want to commit crimes using BTC, such as money laundering and swindling. Therefore, the governments of various countries should impose laws and policies with actions to protect investors' properties and the stability of the financial market. Generally, BTC not only brings new creativities, but it also brings new turmoil. To avoid risks, governments should strengthen the supervision and institutions of Initial Coin Offerings (ICO), and cryptocurrencies should be more transparent.

    There is vast academic literature on the returns and volatility of BTC, but asymmetric research is still insufficient. Precisely, there is scarce research on the use of different generalised autoregressive conditional heteroskedasticity (GARCH) models to further analyse BTC's returns and volatility. In this respect, different GARCH models were used in this study to analyse sample times that are longer than other studies; the characteristics of BTC were found and the safe-haven property and revised asymmetry were quoted. The aim was to explain why the returns and volatility of BTC do not have a "leverage effect", which is rare in this area of study. It is also expected that the findings of this study will be of great help to investors who want to make strategic investment decisions on how to hedge financial risks.

    Originally, BTC and blockchain were first published by Satoshi Nakamoto in the Bitcoin White Book in October of 2008. Generally, a decentralised system and cryptography are essential technologies of cryptocurrencies, as they help digital assets to facilitate security, improve the efficiency of transactions and create additional asset. Macroscopically, blockchain technology is a cutting-edge technology that combines cryptology and computer technology via distributed computing and P2P transferring to yield a distributed system. In the BTC system, every block is a storage space to store the trading information and data between nodes that are interconnected by chains to achieve point-to-point communication and share information and data (Nakamoto, 2008). The framework of BTC was largely designed by locking its protocol. With blockchain being the essential technology of BTC, there is no clear alternative to keeping installed BTC software and maintaining compatibility with intermediary systems. Furthermore, instant transaction validation seems to require an equally fundamental change. In this respect, it will be hard for BTC to adjust (Bohme et al., 2015). With cryptocurrency continuing to become increasingly famous every day, different types of cryptocurrencies, such as Ethereum, Litecoin and Tron, have emerged over time. Nowadays, several innovative digital currencies are waiting in the wings. For example, Litecoin can confirm and read information four times in the same amount of time, making it faster than BTC. This improved functionality potentially facilitates retail payments and other time-sensitive transactions. The electronic and computational burden of mining BTC is reduced in NXT cryptocurrency by replacing work-proof mining with equity proof and allocating the responsibilities of the blockchain according to the proportion of bitcoins held. Besides, Zerocash can improve the protection of privacy by hiding identifiers in the public transaction history, and Peercoin allows the supply of money to slightly grow by 1% a year (Ben-Sasson et al., 2014). Although there are a lot of different cryptocurrencies, they are all founded on the concept of decentralisation and a distributed ledger. Blockchains and distributed ledgers improve the safety of systems since every block connects with each other, which means that there is no centre, or that all points are centred in the system. If hackers want to change any data, they must change over 50% of the points in this system. This means that the cost of tampering with data is higher than that for a traditional currency system with a data centre. Apart from this, Satoshi Nakamoto found that his team set up an electronic trading system that does not rely on trust. The system relies on digital signatures and cryptology, which provide strong supervision over ownership, although this is still not a way to prevent repeat consumption. The pioneers of BTC proposed a point-to-point network that uses the idea of a working proof to record the history of common trading information to solve this problem. If honest nodes cannot control most of the CPU power, an attacker can quickly change the unrealistic history of computing for these transactions. The unstructured simplicity of the network is robust because nodes in this system simultaneously work with little coordination. Besides, the nodes do not need to be verified and identified by the centre because the message is not routed to any particular location, as it is just delivered as best as possible. Nodes can leave and join the network again, accepting the working-proof chain as proof of what happened when they left. Furthermore, nodes vote with their CPU power, extend valid blocks to indicate that they accept valid blocks and reject invalid blocks by refusing to process invalid blocks. Through this consensus mechanism, any necessary rules and incentives can be implemented (Nakamoto, 2008).

    Due to the maximum availability of only 21 million bitcoins and the premium of blockchain technology, the BTC price has increased more than 700 times over the last five years. Currently, there are at least 35 BTC exchange markets where BTC prices are quoted in standard currencies. These exchange markets trade with a daily transaction volume of over 1 million dollars. With more people focusing on cryptocurrencies, some cryptocurrencies have grown faster recently, with examples being BTC, Ethereum, Litecoin and Ripple. However, there are a lot of discussions about whether cryptocurrencies and BTC, in particular, should be classified as currencies, assets or investment vehicles or not. As Chu et al. (2017) found, that their analysis assumes that we are looking at cryptocurrency transactions in the form of financial assets that most users use for investment purposes, either as long-term investments in new technologies or as short-term profits. Studying the fluctuations of cryptocurrencies is an important hedging or pricing tool in financial investment. As such, these results will be particularly useful in terms of portfolio and risk management, and can help others make better-informed decisions about financial investments and the potential benefits and pitfalls of using cryptocurrencies (Chu et al., 2017). In addition, to provide their design decisions with competitiveness, alternative digital currencies need to firstly gain confidence in their adoption and valuation. Services of BTC are beneficial for BTC to receive early enthusiasm of positive media coverage and buyers and sellers on the Silk Road. This combination of advantages will be hard to achieve with alternatives to virtual currencies, but few of them are willing to convert traditional currencies into a competition without good expectations of growth. Whether or not BTC evolves as its supporters imagine, it will provide researchers with an excellent experiment, a laboratory and an attractive means of trading for some traders and consumers (Bohme et al., 2015). BTC is intended as a currency to exchange, but it can also be used as an asset to invest in. Baur et al. (2015) found that the returns attributes of BTC are unlike those of traditional assets, as they afford significant diversification of investments. Through an analysis of the BTC public ledger, researchers found that a third of all bitcoins are held by investors (Baur et al., 2015). For instance, some investors receive bitcoins and they never send them to others. A small number of users, both numerically and in BTC balances, seem to be using BTC as a medium of exchange. This phenomenon shows that BTC is mainly being held as an asset for investment purposes, but not as a currency for trading. Whether BTC volatility leads to investment rather than currency, and thus to a medium of exchange, is a question for future research. Since the scale of BTC investments and transactions is relatively small as compared to other assets, there are no direct risks or even threats to the stability of finance or currency. However, it is important to stress that this conclusion is based on its size. A significant increase in the global acceptance of using BTC or similar virtual currencies to trade could influence the behaviours of consumers and producers, thus changing relative monetary policies. Furthermore, owing to the global dispersion of BTC and its independence from any central bank or supranational institution, regulation will be difficult and challengeable (Baur et al., 2015). An article by Koutmos (2018) examines the link between the returns and transaction activities of BTC. The literature so far has concluded that the price of BTC is unexplainable based on economic factors. The article highlights the importance of using microstructural variables to explain the returns of BTC. The binary value-at-risk model was used here to show a high correlation between the returns of BTC and its activities of trading, although returns can somewhat explain the changes in trading activities, rather than the other way around. To understand BTC, more empirical work is needed. As people can see here, researchers engaged in this sort of work might pay more attention to the microstructure and new variables of BTC instead of the usual economic variables that explain the returns on traditional assets (Dimitrios, 2018). From a market linkages perspective, Klein et al. (2018) used different models to portray that BTC is different from gold, especially in times of downturns. When financial markets fall under similar shocks, BTC drops and shows a positive coupling effect, unlike with gold. In a portfolio application, this point suggests that BTC is not a hedged equity investment. However, the scale of their sample was limited and they were only looking at a small fraction of these recessions. Given the relative youth of the market, this result should be tested again when the cryptocurrency markets are mature. Now, BTC as an asset is unlike any traditional asset from an econometric point of view.

    In the early days, most scholars conducted studies about BTC technologies and development, but currently, people are doing more research on finance. On one hand, Popper (2015) considered BTC as a digital gold for cryptocurrencies. Similar views were shared by Bouri et al. (2017), who emphasised that BTC is a valuable investment in a financial crisis, and that it can be a necessary asset in a portfolio investment. On the other hand, Yermack (2013) argued that BTC facilitates economic transactions to finish in the capitalisation of markets, making it more of a speculative investment than traditional currencies. The author concluded that the volatility of BTC has adverse influences on the stability of BTC as a currency. After these studies, there was some comprehensive literature, which is as follows. Kristoufek (2014) argued that BTC, a special and new asset, shows two characteristics: asset and currency. Besides, research by Anne HD (2016) showed that BTC combines some advantages of traditional currencies, such as gold and the RMB and USD, in financial markets. Therefore, it can be a useful tool for market sentiment analysis, risk analysis and portfolio management. Both Kristoufek (2014) and Anne HD (2016) thought that BTC not only has features of a currency, but also has features of an asset. Furthermore, some researchers started to study the returns and volatility of BTC with BTC price fluctuation. Over the past five years, the price of BTC has changed rapidly. The highest price was 19783 USD in November of 2017, but the lowest price was 3122 USD after a crazy increase in December of 2018 (https://www.coindesk.com/price/bitcoin). Obviously, the volatility and returns of BTC has exhibited a huge change over time, which means that the returns-volatility of BTC has fluctuated over time.

    Figure 1.  Daily price of BTC (USD).

    Regarding the returns and volatility of BTC, Balcilar et al. (2017) concluded that BTC's volume can be used to predict returns, but it is too hard to use it to forecast BTC volatility. In addition, research by Ciaian et al. (2016) paid attention to the determinants of the volatility of BTC prices. The paper shows that several supply-side variables have a smaller impact on the price of BTC than a unique number of BTC daily transactions as a demand-side variable. However, cryptocurrencies are still a relatively unexplored area of research, and there are few studies that investigate the volatility of BTC price. As cryptocurrencies seem to gain legitimacy and profits, it is important to understand the driving forces behind market movements, especially with the creation of derivative markets. Conrad et al. (2018) tried to tease out drivers of the long-term volatility of BTC. They found that the volatility of the S & P 500 has a very significant negative impact on the long-term volatility of BTC, and that the volatility risk premium of the S & P 500 has a significant positive impact on the long-term volatility of BTC. In addition, they found a strong positive correlation between the Baltic Dry Freight index and the long-term volatility of BTC; they reported a significant negative correlation between BTC trading volumes. It is worth noting that the set of data they considered—such as those related to crime—does not seem to explain BTC's volatility, despite extensive media coverage of the topic. They also tested the escape security index proposed by Engle et al. (2012) and found that the long-term fluctuation of BTC tended to decrease during the escape security period. This result is consistent with the author's finding of a negative correlation between BTC volatility and USA stock market risk (Conrad et al., 2018). Besides, Aalborg et al. (2019) found that the quantity of BTC that uses a unique address in the BTC network has a positive relationship with the daily returns of BTC. The author demonstrated that forecasting BTC's returns and volatility may be determined by a series of BTC available. However, sometimes some returns cannot be explained. For instance, BTC's price, like the other prices of assets, cannot be predicted. More importantly, the trading volume of BTC improving is positive for forecasting its volatility. Except in finance, BTC is used to trade energy. For example, the paper by Efthymia and Konstantinos (2018) indicated that there is significant return spillover from energy and technology stocks to BTC. Short-term volatility spillover from technology companies to BTC and the volatility of BTC impact energy companies for a long time via asymmetric impact spillover between BTC and stocks. Finally, Efthymia and Konstantinos (2018) demonstrated the implications and benefits of portfolio management from the perspective of the low dependence of BTC on the stock index. From a geopolitical view, Ahemet et al. (2019) indicated that BTC is a viable tool to hedge geopolitical risks, for example, in conflicts between different countries. Precisely, Ahemet et al. (2019) found that, if they implement a Bayesian Graphical Structural Vector Autoregressive (BGSVAR) estimation procedure, there is predictive power for the price volatility and the returns of BTC, which change in the global GPR index. Klein et al. (2018) illustrated that cryptocurrencies will remain highly volatile with the coming recession, and stated that it is still very unclear whether they will continue to exhibit huge developments in both directions. Important price changes in passwords depend on several factors. First, investors will continue to make profits at peaks of BTC price movements as other cryptocurrencies continue to sharply drop. Second, investor behaviours will be strongly impacted by regulatory decisions. Regulators still put pressure on the legal framework for cryptocurrencies. Third, the cryptocurrency ecosystem has to enhance its standards of propriety to be accepted by traditional investors because of repeated network attacks, such as MtGox and Instawallet.

    After predicting the returns and volatility of BTC, researchers started to use different models to find the returns and volatility of BTC. The volatility of the price was investigated in financial markets early, but the reports on the volatility of the price of BTC are not sufficient. Because BTC prices rapidly change, now more researchers are gradually focusing on this area. Therefore, the excessive volatility of BTC and how to correctly judge it have not been studied enough, leaving a wide research gap. However, BTC price volatility remains a major concern among investors, as numerous studies have shown. For instance, Jamal and Refk (2015) conducted a study that was aimed at providing a discussion of BTC's price fluctuations by using several extensions of the optimal GARCH model. In this case, the results of their study suggested extreme volatility in the price of BTC. Precisely, their findings indicated that conditional variances followed a long memory process between December of 2010 and June of 2015. In this respect, Jamal and Refk (2015) noted that there was a less volatile period of persistence and clustering between January and June of 2015, but that this appeared to be temporary. It is worth noting that, from the two substages under consideration, the BTC volatility process seems to be significantly more affected by negative news than by positive shocks. Not surprisingly, the BTC market is highly motivated by self-fulfilling expectations. It is caused by the behaviour of non-professional noise traders, which may lead to the serious bubble behaviour of BTC and increase the volatility of the price. While BTC users were known primarily as technocrats, liberals and criminals (Yermack, 2013), today users are predominantly individual noise traders and speculators. This has always highlighted how far the BTC market is from maturing. The lack of regulation and transparency adds to the uncertainty surrounding the cryptography market. Therefore, it is hard to predict the future of the currency. However, despite uncertainties and price volatility, it is apparent that the technology behind cryptocurrency is at a point of no technical return. Its philosophy is also not to be outdone by seeing cryptocurrencies in general and related electronic technology transactions. As technology becomes more integrated into our daily lives, it is clear that cryptocurrencies such as BTC will continue to grow, and that BTC may be replaced by better currencies (Jamal and Refk, 2015). Methodologically, the time series of BTC price is substantially more volatile than those of the EUR or USD exchange rates, as its market bubbles and crashes are relatively abundant. Substantial arbitrage opportunities are available for USD or EUR currency pairs involving RMB currency. The HARRVJ model well captures the dynamics of daily realised volatility as aggregated on a 5-minute grid (Lukáš and Taisei, 2017). The time-series model is an essential model of volatility research, but there are fewer variables in this model, so more researchers have used GARCH models to improve the integrality of the tests. Ardia et al. (2019) found that BTC daily log returns have regime changes in their volatility dynamics when treated with the Markov-switch GARCH model. Notably, the Markov-switch GARCH model shows better in-sample performance than standard single-regime GARCH models. When comparing different GARCH models, Katsiampa (2017) found that the AR-CGARCH model is optimal because of its best goodness-of-fit to data, which means that the AR-CGARCH model is the best model to research the volatility and returns of BTC. Furthermore, Beneki et al. (2019) used a bivariate diagonal BEKK-GARCH (1, 1) model that allows the modelling of the variance with the covariance, as well as the application of the impulse response analysis in a Value at Risk (VAR) framework to research the volatility of BTC and Ethereum. The delayed response of BTC volatility to shocks in Ethereum's returns demonstrated the inefficiencies of the BTC market, as shocks take time to affect the full price. Notably, this provides room for a lot of profit and speculation in the most frequently traded cryptocurrency. This can help traders build profit strategies in the derivatives market. This is crucial for traders who are reluctant to include weak cryptocurrencies in their portfolios. As a result, holding BTC at a time of weak demand in the BTC and Ethereum markets may yield exceptional returns for investors, but it does not prove beneficial as a haven (Beneki et al., 2019). The argument can be affirmed by findings by Conrad et al. (2018), which indicated that the prediction of BTC volatility using the GARCH-MIDAS model is superior to the prediction based on a simple GARCH model. For example, when constructing portfolios of BTC and other assets, such as stocks and bonds, their results can be used to improve the time-varying portfolio weights. The results by Beneki et al. (2019) may also be useful for the pricing of BTC futures, as they predicted changes in BTC volatility over a longer period. Finally, simulating BTC fluctuations using the GARCH-MIDAS model can be effectively applied for global economic activity or alternative scenarios based on USA stock market developments. Beneki et al. (2019) suggested that these possibilities be explored in future research. However, they emphasised that all of their results are based on a relatively short sample period. It will be interesting to see if their results hold for longer samples, and when BTC becomes more mature. Chu et al. (2017) found that, in modelling, IGARCH and GJRGARCH models show the best fit for the volatility of the most popular and largest cryptocurrencies. The IGARCH model implements the standard GARCH framework and contains a conditional wave process, which is highly persistent (with unlimited memory), as shown in the literature (Caporale et al., 2003). However, while the conventionally innovative IGARCH (1, 1) seems well suited to many users of cryptocurrency, it has been shown that this may be due to structural changes in the data, which may not be explained by variables such as policy changes (Caporale et al., 2003). Therefore, further analysis of the data set may require confirmation or rejection of possible structural changes. The future work will include fitting the multivariable GARCH model to describe the combined behaviour of the model on BTC, Dash, Dogecoin, Litecoin, Maidsafecoin, Monero and Ripple exchange rates. Such a study will require methodological and empirical development. In addition, the value at risk was used in the current study because it is the most popular measure of risk in finance. However, the transfer of the value at risk highlights the inadequacy of Basel III expectations (see Kinateder and Wagner (2014)). Therefore, another future endeavor will involve using the expected shortages rather than the VAR model (Chu et al., 2017).

    For this study, the closing price of BTC from Coindesk, a platform famous for BTC exchange all over the world, was selected as the research data; it spanned the period of October 1, 2013 to July 31, 2020. Precisely, the study included 2496 observations, which were all drawn from the database. By using Eviews 6.0, the data could be visually presented in a graph, as shown in Figure 2. The figure illustrates that the daily closing price of BTC increased to reach USD 1139.331 by December 5, 2013. The increment was highly associated with the European sovereign debt crisis (ESDC), which happened between 2010 and 2013. During this period, the financial crisis made investors scared of investing in financial products such as stocks, bonds and futures. However, the research found that they were willing to put their money in traditional and high-growth currencies such as gold, silver and cryptocurrencies, such as BTC, Ethereum and Litecoin during economic downtrends (Bouri et al., 2017). After that, the daily closing prices of BTC slightly changed from the beginning of 2014 to the end of 2015. In addition, BTC's closing price rapidly increased during 2016–2017. Its closing price suddenly reached a historical peak at USD 20000, which is 23 times more than one year prior to that time, although there were several fluctuations in 2017. There are some reasons why the daily closing price of BTC increased as it was observed. First, due to global financial markets crashing in September 2016, investors went to hedge negative shocks of the financial crisis, leading to investing in currencies, which included traditional currencies and digital currencies. The rationale as that traditional and digital currencies were still at low prices and their premiums were normal, or even undervalued. As a result, those currencies emerged or served as safe-haven properties at that time. Second, some countries, such as Australia, India, Pakistan and Venezuela, opened their markets to reform their currency system and relevant laws to avoid risks and hedging. Consequently, more investors and media started to pay attention to BTC. Third, according to BTC's algorithm mechanism, when bitcoins were mined to half its original quantity in 2016–2017, BTC's harsh calculation were be hard than before.

    Figure 2.  Daily closing price of BTC (USD).

    However, as the BTC price continued to increase as investors became increasingly more terrified, a sudden drop in price occurred from USD 20000 to USD 13000. In response, there were a great number of investors who sold their BTC, but the BTC price returned to USD 17000 within 2 months. From September to December of 2017, most people guessed that BTC would overtake the historical peak again, but, unfortunately, BTC's closing price fell a cliff from USD 17000 to USD 6000 during the period of December 2017 to February 2018. After that, investors gradually started to sell a great number of bitcoins and change their investment ways. On one hand, BTC's price was overvalued and overheated at that time, so it lost real valuation and fewer investors were using it to invest, opting to instead speculate on its price increasing over time. On the other hand, global financial trends slowly recovered, so more investors were willing to put their money into undervalued assets because they could earn more money from undervalued assets than from overvalued assets. After a volatile period, the BTC closing price continued to dramatically decrease to USD 6000 with some fluctuations. Beginning in October of 2018, BTC's closing price crashed to USD 3800 in January 2019. There are some reasons that are associated with the continued price decline. First, cryptocurrency bubbles were broken by the survival of the fittest. There were a lot of bad cryptocurrencies to be weeded out by the market. Second, Coindesk, the biggest cryptocurrency exchange platform in Japan, was attacked by hackers, which led investors to lose a lot of money, so they lost their enthusiasm in cryptocurrency markets. More importantly, some countries started to reinforce limitations and supervision regarding the trade of cryptocurrencies to avoid money laundering and other financial crimes. Besides, some countries banned the trade of cryptocurrencies, such as China and South Korea. After four months, the closing price of BTC rapidly grew to USD 11000 again. The main reason was that the quantity of available BTC halved again, which means that it became harder to mine than before, so investors focused on it again and thought it would be more valuable. After another volatile time, the closing price of BTC gradually change to a downtrend. Until July 2020, BTC's daily price kept fluctuating with a mean of USD 8000.

    Pt is the closing price of BTC on Day t. For the estimation process, the daily rate of return is considered to be a variable that can be easily observed. In order to reduce errors during this process, a natural logarithm was applied to treat the daily rate of return; this means that the daily return of BTC is expressed as a logarithmic first-order difference between the closing prices of the next two days. The formula of BTC returns is

    r = log(ptpt-1) (1)

    All analysis of the data of the research was performed using Eviews 6.0 and Microsoft Excel.

    Figures 2 and 3 show the descriptive statistics for BTC's daily return rate.

    Figure 3.  BTC daily rate of return (r) volatility graph.

    Figure 3 is a volatility diagram of the daily rate of return (r) for BTC. The figure illustrates that fluctuation of the daily rate of return (r) reveals obvious time-varying, clustering and unpredictable characteristics. From the figure, it can be clearly seen that BTC's daily return in 2013 had strong volatility. This is because, in 2013, the ESDC brought a financial crisis, so people paid attention to currency that was not overvalued as a safe-haven property. Apart from this, the volatility of the daily return in 2013 was the strongest for the whole sample period. After that period, the volatility gradually reduced, and then it suddenly grew during the period of January 2014 to January 2015. However, until mid-2015, the volatility slowly decreased. Then, the volatility repeatedly fluctuated again from the beginning of 2015 to the end of 2016. Interestingly, the volatilities crowded in 2017–2018. Analysis of Figures 2 and 3 together shows that BTC's daily price changed frequently between 2017 and 2018. Because of the available BTC quantity halving (and other reasons), there was a great number of investors who focused on it and invested in it, leading to daily returns enormously changing over time. The volatility of the returns of BTC first rose in 2017, but it quickly decreased in 2018. After that, the volatility kept fluctuating in 2019. Especially, because of COVID-19 and a trade war between China and the USA in 2020, the global economy showed a downtrend tendency. Therefore, BTC is still a safe-haven asset to hedge against negative shocks.

    It can be seen from Figure 4 that, during the sample period, the average value of the BTC daily return (r) was 0.1803%, standard deviation was 4.3301% and skewness was −0.405714; and, the left skew kurtosis of 10.22475 was much higher than the normal distribution of kurtosis 3. The daily rate of return (r) results exhibited a sharp peak and thick tail characteristic. The sharp peak and thick tail feature were confirmed via a normality test. Besides, the Jarque-Bera (J-B) statistic was 5494.756. The rate of return (r) was significantly different from the normal distribution on a very small level, that is, when the sequence used the F test or all of the test methods based on the normal distribution statistical method could not test the return sequence.

    Figure 4.  Histogram of BTC's return rate (r).

    The unit root method, the most common method in stationarity testing, was proposed by two American statisticians, Dickey and Fuller, in the 1970s. It judges whether the autocorrelation coefficient is equal to 1. After nearly 30 years of academic research, this method was finally summarised as the ADF test method.

    From the above descriptive statistical analysis, it is apparent that the return rate series fluctuates around the mean, and that there is no trend (R mean = 0.001803). Therefore, the ADF unit root test was performed on the sequence, and four lags were selected, with an intercept term and a no-trend term. The test results are as follows.

    Table 1.  Stability test results for the rate of returns.
    Null Hypothesis: R has a unit root
    Exogenous: Constant
    Lag Length: 4 (Fixed)
    t-Statistic Probability*
    ADF test statistic −20.736 0.000
    Test critical values: 1% level −3.433
    5% level −2.863
    10% level −2.567
    *MacKinnon (1996) one-sided p-values.

     | Show Table
    DownLoad: CSV

    From the unit root test results, it can be seen that the t value of the BTC return rate series was −20.736, which was much smaller than −3.433 at the 1% level. Thus, H0 was rejected, indicating that the BTC return rate r obeys the I (0) process, that is, there is no unit root in a stationary time series.

    In econometrics, the autoregressive conditional heteroscedasticity (ARCH) model, a statistical model for time-series data, describes the variance of the current error term or innovation as a function of the actual sizes of the previous periods' error terms. Normally, the variance is related to the squares of the previous innovations. The ARCH model is appropriate when the error variance in a time series follows an autoregressive (AR) model. ARCH models are commonly employed to model financial time series that exhibit time-varying volatility and volatility clustering, such as periods of swings interspersed among periods of relative calm. ARCH-type models are sometimes considered to be in the family of stochastic volatility models, although this is technically incorrect since, at time t, the volatility is completely pre-determined (deterministic) given previous cues.

    Using an ARCH model to model a time series, ϵt expresses the returns or residuals of returns and σt, a time-dependent standard deviation, characterises the typical scale of the terms. In addition, Zt is a random variable with a strong white-noise process.

    ϵt= σ tzt (2)

    The series σ2t is modelled by

    σ2t=α0+α1ϵ2t-1+α2ϵ2t-2++αq1ϵ2t-q-1+αqϵ2t-q = α0+qi=1αiϵ2t-i (3)

    where > 0 and αi ≥ 0, i > 0.

    The GARCH model transforms from an AR moving average (ARMA) model when the ARMA model is assumed for the error variance.

    A GARCH (p, q) model is a normal GARCH model. p is the order of the GARCH terms. α2 and q denote the order of the ARCH terms ϵ2.

    The equation for a GARCH (p, q) model is

    yt=xtb+ϵt (4)
    σ2t=ω+α1ϵ2t1++αqϵ2tq+β1σ2t1++βpσ2tp=ω+qi=1αiϵ2ti+pi=1βiσ2ti (5)

    The nonlinear asymmetric GARCH (1, 1) model is a model with the following specifications:

    σ2t=ω+α(ϵt1θσt1)2+βσ2t1 (6)

    α > 0, β ≥ 0, ω > 0 and α(1+θ2)+β<1, which ensures the non-negativity and stationarity of the variance process. This model reflects a phenomenon commonly referred to as the "leverage effect", as it signifies that negative return increases future volatility by a larger amount than positive returns of the same magnitude.

    The exponential GARCH (EGARCH) model is another form of the GARCH model. Formally, an EGARCH (p, q) model is expressed as follows:

    logσ2t=ω+qk=1βkg(Ztk)+pl=1αklogα2tk (7)

    where g(Zt)=θZt+λ(|Zt|E(|Zt|)), the conditional variance is σ2t,α,θ and λ are coefficients, a standard normal variable or come from a generalised error distribution is Zt. The equation for g(Zt) allows the sign and the magnitude of Zt to have separate effects on the volatility. Since logσ2t may be negative, there are no sign restrictions for the parameters.

    Regarding asymmetry, there are a lot of sufficient pieces of evidence to show that negative shocks generate more effects than positive shocks in the stock market (Glosten et al., 1993; Bollerslev et al., 1986). There are two theories that have been used to illustrate these negative return and volatility relationship inequities. First, volatility feedback is one of the theories (Campbell and Hentschel, 1992). This theory shows that the expected increase in volatility increases the required return on equity, leading to a fall in equity prices. In other words, a positive shock to volatility leads first to lower equity returns, which in turn increases the time-varying risk premium. However, the negative change of expected return tends to be more severe than the positive change of expected return, which leads to the phenomenon of asymmetric volatility. The aspect can also be explained via the leverage hypothesis. The leverage hypothesis states that, when the ratio of stock to the valuation of a company decreases but the ratio of debt to the valuation of the company increases, there is a risk that the company stock will rise in the dropping valuation of a company. This negative relation leads to a spike in stock volatility (Black, 1976; Duffee, 1995).

    Unlike stocks, the volatility of gold returns has the opposite reaction to negative shocks, which means that positive shocks of the same degree produce more volatility than negative shocks (Baur, 2012). Baur (2012), while also citing Bollerslev et al. (1986), further argued that, for a commodity such as gold, such a positive return-volatility relationship cannot be properly explained by the leverage effect or volatility feedback, as it is related to a safe-haven asset. When the price of gold rises during the downward movement of the market, investors interpret it as an increase in the uncertainty of the macroeconomic environment, which consequently transfers the uncertainty and volatility of the stock market to the gold market. In contrast, if gold prices fall during a stock market rally, this uncertainty of volatility is also transmitted to the gold market by investors. With the Commodity Futures Trading Commission (CFTC) accepting BTC as a commodity, any evidence of a positive reaction-volatility relationship in the BTC market is likely to point to a safe-haven property. This evidence can be used to expand the usefulness of BTC as a hedge against stock market turbulence.

    A time series approach was used in this study; thus, the equation for BTC's return rate (r) took the following form:

    rt=c0+ni=1cirt1+εt (8)

    Regression was independently performed on Lags 1, 2, 3 and 4, and the results are shown in Table 2.

    Table 2.  Selection of AR order.
    Lag AIC F-statistic
    1 −3.44017 1.184208
    2 −3.444386 1.266232
    3 −3.445114 0.025164
    4 −3.446444 4.118333

     | Show Table
    DownLoad: CSV

    According to Table 2, because smaller Akaike Information Criterion (AIC) can avoid overfitting and bigger F-statistics means coefficient is better, AIC is the smallest and F-statistics is the biggest item in lag 4. Thus, Table 2 clearly shows that the lag 4 period was the best, so the lag order was selected as 4. Thus, the formula can be written as

    rt=c0+c1rt1+c2rt2+c3rt3+c4rt4+εt (9)

    Sequence residuals and the residual squared autocorrelation graphs were drawn. From Figures 4 and 5, the results show that there was no significant autocorrelation in the residual term of the BTC return (r), but the residual squared had significant autocorrelation.

    Figure 5.  Autocorrelation (AC) and partial autocorrelation (PAC) values for the AC coefficient for the residual term of BTC returns (r).
    Figure 6.  AC coefficient, AC and PAC results for the residual square of the BTC returns (r).

    A line graph of the squared residuals was drawn. It can be seen from the figure that the fluctuation of the residual of the regression equation exhibited the phenomenon of grouping; particularly, fluctuations were very small in some longer periods and larger in other longer periods, demonstrating obvious temporal variability and clustering. This shows that the residual sequence had a high-order ARCH effect, which is suitable for modelling with GARCH models. The graph shows that the residuals in 2013–2014 crowded together with high volatilities, which means that there were a great number of people investing in BTC based on emotions during that period of the time. Apart from this, the grouping phenomenon suddenly came up again in 2017–2018. It can be explained by the halving of quantity of BTC that resulted in overvaluation of BTC and a BTC bubble that led investors to rapidly sell their bitcoins, which caused the volume of transactions of BTC to be really large. In 2020, although the grouping phenomenon was not very obvious, the volatility remained at a high level. To sum up, the mean volatility of BTC always remained at a high level and there was culminant buying and selling of BTC during a period of time.

    ARCH-LM testing, the standard test to detect autoregressive conditional heteroscedasticity, was first be presented by Engle in 1982. ARCH-LM testing was performed on the residuals of serial linear regression, and the object of the F test was the joint significance of the squared residuals of all of the lags. The Obs*R statistic is the LM test statistic, which is the number of observations multiplied by the test regression R. Given the significance level α = 0.05 and a degree of freedom of 9, the value of LM was 284.1393, which is greater than the critical value of 16.9190, and the concomitant probability P was 0.0000, which is less than 0.05. The null hypothesis was rejected. This shows that there was obvious heteroscedasticity in the return sequence, and that the residual had a strong ARCH effect. Therefore, it is reasonable that the GARCH model was selected to simulate the data for BTC's returns rate.

    Table 3.  ARCH-LM test for the residual of the BTC return.
    Heteroskedasticity Test: ARCH
    F-statistic 35.50890 Pro. F (9, 2472) 0.0000
    Obs*R-squared 284.1393 Pro. Chi-Square (9) 0.0000

     | Show Table
    DownLoad: CSV

    The estimation results for the GARCH (1, 1) model are shown in Table 4.

    rt=0.0010340.008808γ (10)
    (1.554)(0.421)
    σ2t=7.6×105+0.189179ε2t1+0.785817σ2t1 (11)
    (13.749)   (14.271)   (63.130)
    Table 4.  GARCH (1, 1) model estimation results.
    Dependent Variable: R
    Method: ML-ARCH (Marquardt)–Normal distribution
    Sample (adjusted): 10/03/2013–7/31/2020
    Included observations: 2491 after adjustments
    Convergence achieved after 21 iterations
    Coefficient Standard Error z-Statistic Probability
    C 0.001034 0.000666 1.554104 0.1202
    R (-4) −0.008808 0.020909 −0.421273 0.6736
    Variance Equation
    C 0.000076 0.00000553 13.74898 0.0000
    RESID (-1) ^2 0.189179 0.013256 14.27126 0.0000
    GARCH (-1) 0.785817 0.012448 63.12982 0.0000

     | Show Table
    DownLoad: CSV

    The results are as follows: log likelihood = 4731.619, AIC = −3.795 and SC = −3.783.

    From this model, it can be seen that, in the conditional variance equation for BTC's return rate, both the ARCH and GARCH terms are highly significant. This significance indicates that the volatility of the return rate series had clustering characteristics. Additionally, the dependent variable was R and the sample time was from October 6, 2013 to July 31, 2020, which included 2491 observations after adjustments. Besides, convergence was achieved after 21 iterations. The sum of the ARCH term and the GARCH term for the BTC rate of return was 0.974996 < 1, which meets the constraints on the parameters. But, since the sum of the two coefficients (0.974996) is very close to 1, it can be ascertained that the impact of the shock on the conditional variance was not transient, as it is a permanent process. Then, the impact can be inferred from this feature to play an important role in future predictions, so GARCH (1, 1) modelling is a smooth process. However, the conditional variance shows that the influence of past fluctuations is limited, and that its influence on the future tends to gradually attenuate to 0, which is called mean-reversion.

    The estimation results for the Threshold ARCH (TARCH) model are shown in the following table.

    rt=0.0010390.00876γ (12)
    (4.435)   (0.410)
    σ2t=7.60×105+0.18969ε2t10.001122ε2t1dt1+0.78587σ2t1 (13)
    (13.675)    (11.340)    (0.072)    (63.115)

    The results were as follows: log likelihood = 473.620, AIC = −3.794 and SC = −3.780.

    Table 5 shows that the dependent variable was R and sample time spanned October 6, 2013 to July 31, 2020, which included 2491 observations after adjustments. In the TARCH model, the leverage effect term is described by (RESID < 0) * ARCH (1). The coefficient estimate of the ARCH (1)*(RESID (−1) < 0) (i.e., the in the model) term is negative and not significant (β = −0.001122, p > 0), which shows that the special price fluctuation did not exhibit a leverage effect.

    Table 5.  TARCH model estimation results.
    Dependent Variable: R
    Method: ML-ARCH (Marquardt) – Normal distribution
    Sample (adjusted): 10/06/2013 7/31/2020
    Included observations: 2491 after adjustments
    Convergence achieved after 25 iterations
    Coefficient Standard Error z-Statistic Probability
    C 0.001039 0.000724 1.434527 0.1514
    R (-4) −0.00876 0.021361 −0.4101 0.6817
    Variance Equation
    C 7.6E−05 5.56E−06 13.67519 0.0000
    RESID (-1) ^2 0.18969 0.016727 11.34065 0.0000
    ARCH (1) * (RESID (-1) < 0) −0.001122 0.015673 −0.071609 0.9429
    GARCH (-1) 0.78587 0.012451 63.11544 0.0000

     | Show Table
    DownLoad: CSV

    The estimation results for the EGARCH model are shown in the following table.

    rt=0.0010520.025538γ (14)
    (1.629)(1.221)
    Log(σ2t)=0.691107+0.336807|εt1σt1|0.001903(εt1σt1)+0.9682log(σ2t1) (15)
    (17.826)(19.081)(0.229)(213.079)
    Table 6.  EGARCH (1, 1) model estimation results.
    Dependent Variable: R
    Method: ML-ARCH (Marquardt) – Normal distribution
    Sample (adjusted): 10/06/2013 7/31/2020
    Included observations: 2491 after adjustments
    Convergence achieved after 37 iterations
    Coefficient Standard Error z−Statistic Probability
    C 0.001052 0.000646 1.629147 0.1033
    R (-4) −0.025538 0.020908 −1.221422 0.2219
    Variance Equation
    C −0.691107 0.03877 −17.8256 0.0000
    ABS (RESID (-1)/@SQRT (GARCH (-1))) 0.336807 0.017652 19.08078 0.0000
    RESID (-1)/SQRT (GARCH (-1)) −0.001903 0.008307 −0.229028 0.8188
    LOG (GARCH (-1)) 0.930196 0.004365 213.0794 0.0000

     | Show Table
    DownLoad: CSV

    As is notable from the above table, the dependent variable was R and the sample time spanned October 6, 2013 to July 31, 2020, which included 2491 observations after adjustments. In the EGARCH model, the coefficient for the asymmetric term RESID (-1)/@SQRT(GARCH (−1)) was significantly less than zero (β = 0.001903, p > 0.05), indicating that BTC during the sample period was no leverage effect in the rate of return. Whether there were negative shocks or positive shocks, the shocks only brought an impact of α = 0.336807.

    To sum up, the GARCH (1, 1) model results show that the returns and volatility of BTC have clustering characteristics. Figures 7 and 8 show that the BTC returns and volatility sharply increased from 2013 to 2014, 2017 to 2018 and 2019 to 2020. The ESDC happened in 2013–2014, a trade war between China and the USA started in 2017–2018 and the COVID-19 pandemic arose in 2019–2020, all amounting to famous financial crises. Interestingly, financial market returns declined during the financial crash, but the returns of BTC rose. This phenomenon can be explained by a reduction in interest rates and monetary excessing. Because the central banks of countries across the world issued more of their currency to hedge risks of economic depression with a low interest rate, people had more money. However, they wanted to minimise inflation, so investments were helpful. Due to the issuance of more currencies, BTC can be a low valuation asset for investment; thus, it is a concern of capital for every country. This is why BTC returns and volatility exhibited a clustering feature during several periods. Besides, the findings associated with the GARCH (1, 1) model indicate that the shocks affecting conditional variance are a part of a long-term process, so this finding can be used to predict the returns and volatility of BTC in the future. However, because conditional variance is limited to influencing the future returns and volatility of BTC, its effect gradually decreases; this can effectively explain why BTC's returns and volatility decrease after financial crises and crashes.

    Figure 7.  BTC returns (r) residual square line graph.

    Furthermore, ARCH and EGARCH models were used for analysis because the GARCH (1, 1) model cannot explain the leverage effect, which is an asymmetric effect observable in returns and volatility research. The results drawn from the TARCH and EGARCH models illustrate that BTC's returns and volatility do not exhibit the leverage effect, which means that the returns and volatility of BTC have asymmetric relations. But, the figure for returns and volatility understandably showed an asymmetric effect between positive and negative shocks; for example, when negative shock in light of COVID-19 came up in 2019–2020, BTC's returns and volatility sharply increased. But, before COVID-19 happened, a positive shock brought a smaller change in its returns and volatility. As an asset, BTC should exhibit characteristics similar to other assets, such as stocks, bonds and gold. However, it demonstrated a revised phenomenon as compared with stock. Similarly, gold returns and volatility appeared to resemble trends. In addition, the CFTC accepted BTC as a commodity in October of 2015. Besides, gold and BTC have a significant correlation, so the revised asymmetry of BTC cannot be easily explained by the leverage effect. Based on this critical thinking, the conception of a safe-haven property was discussed. A safe-haven property is an asset that can offer defence protection to hedge risk during a financial crisis. Between 2013 and 2014, 2017 and 2018 and 2019 and 2020, BTC played the role of a safe-haven property, so financial institutions and other investors were able to add BTC to their investment portfolios to efficiently avoid and hedge financial risk.

    This research did not receive any specific grant from funding agencies in the public, commercial or not-for-profit sectors.

    The authors declare no conflicts of interest in this study.



    [1] G. Tang, H. Mai, How does manufacturing intelligentization influence innovation in china from a nonlinear perspective and economic servitization background?, Sustainability, 14 (2022), 14032–14032. https://doi.org/10.3390/su142114032 doi: 10.3390/su142114032
    [2] H. Zhang, G. Xu, R. Pan, H. Ge, A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time, Eng. Optim., 54 (2022), 1646–1667. https://doi.org/10.1080/0305215X.2021.1949007 doi: 10.1080/0305215X.2021.1949007
    [3] Ö. Tosun, M. K. Marichelvam, N. Tosun, A literature review on hybrid flow shop scheduling, J. Oper. Manage., 12 (2020), 156–194. https://doi.org/10.1504/IJAOM.2020.108263 doi: 10.1504/IJAOM.2020.108263
    [4] L. Wang, Shop Scheduling with Genetic Algorithms, Tsinghua University & Springer Press, Beijing, 2003.
    [5] W. Xu, R. Wu, L. Wang, X. Zhao, X. Li, Solving a multi-objective distributed scheduling problem for building material equipment group enterprises by measuring quality indicator with a product gene evaluation approach, Comput. Ind. Eng., 168 (2022), 108142. https://doi.org/10.1016/j.cie.2022.108142 doi: 10.1016/j.cie.2022.108142
    [6] Y. Koren, S. J. Hu, P. Gu, M. Shpitalni, Open-architecture products, CIRP Ann., 62 (2013), 719–729. https://doi.org/10.1016/j.cirp.2013.06.001 doi: 10.1016/j.cirp.2013.06.001
    [7] F. Tao, Q. Qi, A. Liu, A. Kusiak, Data-driven smart manufacturing, J. Manuf. Syst., 48 (2018), 157–169. https://doi.org/10.1016/j.jmsy.2018.01.006 doi: 10.1016/j.jmsy.2018.01.006
    [8] J. Leng, Z. Chen, W. Sha, Z. Lin, J. Lin, Q. Liu, Digital twins-based flexible operating of open architecture production line for individualized manufacturing, Adv. Eng. Inf., 53 (2022), 101676. https://doi.org/10.1016/j.aei.2022.101676 doi: 10.1016/j.aei.2022.101676
    [9] W. Shen, L. Wang, Q. Hao, Agent-based distributed manufacturing process planning and scheduling: a state-of-the-art survey, IEEE Trans. Syst. Man Cybern. Syst., 36 (2006), 563–577. https://doi.org/10.1109/TSMCC.2006.874022 doi: 10.1109/TSMCC.2006.874022
    [10] R. Agarwal, P. De, C. E. Wells, Cooperative distributed problem solving: an investigation in the domain of job shop scheduling, in Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences, IEEE, 3 (1995), 4–12. https://doi.org/10.1109/HICSS.1995.375579
    [11] C. P. Gomes, A. Tate, L. Thomas, A distributed scheduling framework, in Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94, IEEE, (1994), 49–55. https://doi.org/10.1109/TAI.1994.346514
    [12] A. Toptal, I. Sabuncuoglu, Distributed scheduling: a review of concepts and applications, Int. J. Prod. Res., 48 (2010), 5235–5262. https://doi.org/10.1080/00207540903121065 doi: 10.1080/00207540903121065
    [13] Z. Shao, W. Shao, D. Pi, Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem, Swarm Evol. Comput., 59 (2020), 100747. https://doi.org/10.1016/j.swevo.2020.100747 doi: 10.1016/j.swevo.2020.100747
    [14] S. Apte, N. Petrovsky, Will blockchain technology revolutionize excipient supply chain management?, J. Excipients Food Chem., 7 (2016), 76–78.
    [15] F. Tao, J. Cheng, Q. Qi, M. Zhang, H. Zhang, F. Sui, Digital twin-driven product design, manufacturing and service with big data, Int. J. Adv. Manuf. Technol., 94 (2018), 3563–3576. https://doi.org/10.1007/s00170-017-0233-1 doi: 10.1007/s00170-017-0233-1
    [16] J. Yli-Huumo, D. Ko, S. Choi, S. Park, K. Smolander, Where is current research on blockchain technology?—a systematic review, PLoS One, 11 (2016), e163477. https://doi.org/10.1371/journal.pone.0163477 doi: 10.1371/journal.pone.0163477
    [17] J. Leng, P. Jiang, K. Xu, Q. Liu, J. L. Zhao, Y. Bian, et al., Makerchain: A blockchain with chemical signature for self-organizing process in social manufacturing, J. Clean. Prod., 234 (2019), 767–778. https://doi.org/10.1016/j.jclepro.2019.06.265 doi: 10.1016/j.jclepro.2019.06.265
    [18] Y. Wu, Cloud-edge orchestration for the internet of things: architecture and AI-powered data processing, IEEE Internet Things, 8 (2021), 12792–12805. https://doi.org/10.1109/JIOT.2020.3014845 doi: 10.1109/JIOT.2020.3014845
    [19] J. Leng, Z. Chen, W. Sha, S. Ye, Q. Liu, X. Chen, Cloud-edge orchestration-based bi-level autonomous process control for mass individualization of rapid printed circuit boards prototyping services, J. Manuf. Syst., 63 (2022), 143–161. https://doi.org/10.1016/j.jmsy.2022.03.008 doi: 10.1016/j.jmsy.2022.03.008
    [20] L. Wang, W. Shen, Process Planning and Scheduling for Distributed Manufacturing, Springer Science & Business Media, 2007.
    [21] P. Wu, Y. Wang, J. Cheng, Y. Li, An improved mixed-integer programming approach for bi-objective parallel machine scheduling and location, Comput. Ind. Eng., 174 (2022), 108813. https://doi.org/10.1016/j.cie.2022.108813 doi: 10.1016/j.cie.2022.108813
    [22] V. Heinz, A. Novák, M. Vlk, Z. Hanzálek, Constraint programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers, Comput. Ind. Eng., 172 (2022), 108586. https://doi.org/10.1016/j.cie.2022.108586 doi: 10.1016/j.cie.2022.108586
    [23] G. Song, R. Leus, Parallel machine scheduling under uncertainty: Models and exact algorithms, INFORMS J. Comput., 34 (2022), 3059–3079. https://doi.org/10.1287/ijoc.2022.1229 doi: 10.1287/ijoc.2022.1229
    [24] N. Farmand, H. Zarei, M. Rasti-Barzoki, Two meta-heuristic algorithms for optimizing a multi-objective supply chain scheduling problem in an identical parallel machines environment, Int. J. Ind. Eng. Comput., 12 (2021), 249–272. https://doi.org/10.5267/j.ijiec.2021.3.002 doi: 10.5267/j.ijiec.2021.3.002
    [25] M. Abedi, H. Seidgar, H. Fazlollahtabar, R. Bijani, Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limits, Int. J. Prod. Res., 53 (2015), 1680–1711. https://doi.org/10.1080/00207543.2014.952795
    [26] Y. Zheng, Y. Yuan, Q. Zheng, D. Lei, A hybrid imperialist competitive algorithm for the distributed unrelated parallel machines scheduling problem, Symmetry, 14 (2022), 204. https://doi.org/10.3390/sym14020204 doi: 10.3390/sym14020204
    [27] R. Logendran, B. McDonell, B. Smucker, Scheduling unrelated parallel machines with sequence-dependent setups, Comput. Oper. Res., 34 (2007), 3420–3438. https://doi.org/10.1016/j.cor.2006.02.006 doi: 10.1016/j.cor.2006.02.006
    [28] J. Behnamian, S. F. Ghomi, The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine, Inf. Sci., 219 (2013), 181–196. https://doi.org/10.1016/j.ins.2012.07.020 doi: 10.1016/j.ins.2012.07.020
    [29] D. Lei, M. Liu, An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance, Comput. Ind. Eng., 141 (2020), 106320–106320. https://doi.org/10.1016/j.cie.2020.106320 doi: 10.1016/j.cie.2020.106320
    [30] G. Bektur, T. Saraç, A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server, Comput. Ind. Eng., 103 (2018), 46–63. https://doi.org/10.1016/j.cor.2018.10.010
    [31] H. Jouhari, D. Lei, M. A. Al-qaness, , M. A. Elaziz, A. A. Ewees, O. Farouk, Sine-cosine algorithm to enhance simulated annealing for unrelated parallel machine scheduling with setup times, Mathematics, 7 (2019), 1120. https://doi.org/10.3390/math7111120 doi: 10.3390/math7111120
    [32] D. Lei, Y. Yuan, J. Cai, D. Bai, An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling, Int. J. Prod. Res., 58 (2020), 597–614. https://doi.org/10.1080/00207543.2019.1598596 doi: 10.1080/00207543.2019.1598596
    [33] D. Li, J. Wang, R. Qiang, R. Chiong, A hybrid differential evolution algorithm for parallel machine scheduling of lace dyeing considering colour families, sequence-dependent setup and machine eligibility, Int. J. Prod. Res., 59 (2020), 1–17. https://doi.org/10.1080/00207543.2020.1740341
    [34] D. Lei, Y. Yuan, J. Cai, An improved artificial bee colony for multi-objective distributed unrelated parallel machine scheduling, Int. J. Prod. Res., 59 (2020), 1–13. https://doi.org/10.1080/00207543.2020.1775911 doi: 10.1080/00207543.2020.1775911
    [35] B. Shahidi-Zadeh, R. Tavakkoli-Moghaddam, A. Taheri-Moghadam, I. Rastgar, Solving a bi-objective unrelated parallel batch processing machines scheduling problem: A comparison study, Comput. Ind. Eng., 88 (2017), 71–90. https://doi.org/10.1016/j.cor.2017.06.019 doi: 10.1016/j.cor.2017.06.019
    [36] Y. He, C. W. Hui, Automatic rule combination approach for single-stage process scheduling problems, AIChE J., 53 (2007), 2026–2047. https://doi.org/10.1002/aic.11236 doi: 10.1002/aic.11236
    [37] Z. Pan, D. Lei, L. Wang, A knowledge-based two-population optimization algorithm for distributed energy-efficient parallel machines scheduling, IEEE Trans. Cybern., 52 (2020), 5051–5063. https://doi.org/10.1109/TCYB.2020.3026571 doi: 10.1109/TCYB.2020.3026571
    [38] L. Zhang, Q. Deng, Y. Zhao, Q. Fan, X. Liu, G. Gong, Joint optimization of demand-side operational utility and manufacture-side energy consumption in a distributed parallel machine environment, Comput. Ind. Eng., 164 (2022), 107863. https://doi.org/10.1016/j.cie.2021.107863 doi: 10.1016/j.cie.2021.107863
    [39] X. Wu, A. Che, A memetic differential evolution algorithm for energy-efficient parallel machine scheduling, Omega, 82 (2018), 155–165. https://doi.org/10.1016/j.omega.2018.01.001 doi: 10.1016/j.omega.2018.01.001
    [40] J. Behnamian, M. Zandieh, S. F. Ghomi, Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm, Expert Syst. Appl., 36 (2009), 9637–9644. https://doi.org/10.1016/j.eswa.2008.10.007
    [41] M. Yazdani, S. Gohari, B. Naderi, Multi-factory parallel machine problems: Improved mathematical models and artificial bee colony algorithm, Comput. Ind. Eng., 81 (2015), 36–45. https://doi.org/10.1016/j.cie.2014.12.023 doi: 10.1016/j.cie.2014.12.023
    [42] J. Behnamian, S. F. Ghomi, The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine, Inf. Sci., 219 (2013), 181–196. https://doi.org/10.1016/j.ins.2012.07.020 doi: 10.1016/j.ins.2012.07.020
    [43] J. Behnamian, Matheuristic for the decentralized factories scheduling problem, Appl. Math. Model., 47 (2017), 668–684. https://doi.org/10.1016/j.apm.2017.02.033 doi: 10.1016/j.apm.2017.02.033
    [44] J. Behnamian, Heterogeneous networked cooperative scheduling with anarchic particle swarm optimization, IEEE Trans. Eng. Manage., 64 (2017), 166–178. https://doi.org/10.1016/j.apm.2017.02.033 doi: 10.1016/j.apm.2017.02.033
    [45] J. Behnamian, S. M. T. F. Ghomi, Multi-objective multi-factory scheduling, RAIRO-Oper. Res., 55 (2021), S1447–S1467. https://doi.org/10.1051/ro/2020044 doi: 10.1051/ro/2020044
    [46] J. Behnamian, H. Asgari, A hyper-heuristic for distributed parallel machine scheduling with machine-dependent processing and sequence-dependent setup times, RAIRO-Oper. Res., 56 (2022), 4129–4143. https://doi.org/10.1051/ro/2022194 doi: 10.1051/ro/2022194
    [47] S. Hatami, R. Ruiz, C. Andrés-Romano, Heuristics for a distributed parallel machine assembly scheduling problem with eligibility constraints, in 2015 International Conference on Industrial Engineering and Systems Management (IESM), (2015), 145–153. https://doi.org/10.1109/IESM.2015.7380149
    [48] S. Hatami, R. R. García, C. A. Romano, The Distributed Assembly Parallel Machine Scheduling Problem with eligibility constraints, Int. J. Eng. Sci., 3 (2015), 13–23. https://doi.org/10.4995/ijpme.2015.3345 doi: 10.4995/ijpme.2015.3345
    [49] A. Hamzadayı, An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem, Comput. Oper. Res., 123 (2020), 105006. https://doi.org/10.1016/j.cor.2020.105006 doi: 10.1016/j.cor.2020.105006
    [50] V. Fernandez-Viagas, J. M. Framinan, A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem, Int. J. Prod. Res., 53 (2015), 1111–1123. https://doi.org/10.1080/00207543.2014.948578 doi: 10.1080/00207543.2014.948578
    [51] J. Y. Mao, Q. K. Pan, Z. H. Miao, L. Gao, S. Chen, A hash map-based memetic algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime, Knowl. Based Syst., 242 (2022), 108413. https://doi.org/10.1016/j.knosys.2022.108413 doi: 10.1016/j.knosys.2022.108413
    [52] K. Wang, Y. Huang, H. Qin, A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown, J. Oper. Res. Soc., 67 (2016), 68–82. https://doi.org/10.1057/jors.2015.50 doi: 10.1057/jors.2015.50
    [53] B. Naderi, R. Ruiz, The distributed permutation flowshop scheduling problem, Comput. Oper. Res., 37 (2010), 754–768. https://doi.org/10.1016/j.cor.2009.06.019 doi: 10.1016/j.cor.2009.06.019
    [54] E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem, Eur. J. Oper. Res., 47 (1990), 65–74. https://doi.org/10.1016/0377-2217(90)90090-X doi: 10.1016/0377-2217(90)90090-X
    [55] J. Gao, R. Chen, W. Deng, An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem, Int. J. Prod. Res., 51 (2013), 641–651. https://doi.org/10.1080/00207543.2011.644819 doi: 10.1080/00207543.2011.644819
    [56] S. Y. Wang, L. Wang, M. Liu, Y. Xu, An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem, Int. J. Prod. Econ., 145 (2013), 387–396. https://doi.org/10.1016/j.ijpe.2013.05.004 doi: 10.1016/j.ijpe.2013.05.004
    [57] D. Ferone, S. Hatami, E. M. González‐Neira, A. A. Juan, P. Festa, A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem, Int. Trans. Oper. Res., 27 (2020), 1368–1391. https://doi.org/10.1111/itor.12719 doi: 10.1111/itor.12719
    [58] J. P. Huang, Q. K. Pan, L. Gao, An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, Swarm Evol. Comput., 59 (2020), 100742. https://doi.org/10.1016/j.swevo.2020.100742 doi: 10.1016/j.swevo.2020.100742
    [59] Y. Xu, L. Wang, S. Wang, M. Liu, An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem, Eng. Optim., 46 (2014), 1269–1283. https://doi.org/10.1080/0305215X.2013.827673 doi: 10.1080/0305215X.2013.827673
    [60] A. Ali, Y. Gajpal, T. Y. Elmekkawy, Distributed permutation flowshop scheduling problem with total completion time objective, Opsearch, (2020), 1–23. https://doi.org/10.1007/s12597-020-00484-3
    [61] A. Hamzadayı, An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem, Comput. Oper. Res., 123 (2020), 105006. https://doi.org/10.1016/j.cor.2020.105006 doi: 10.1016/j.cor.2020.105006
    [62] J. Y. Mao, Q. K. Pan, Z. H. Miao, L. Gao, S. Chen, A hash map-based memetic algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime, Knowl. Based Syst., 242 (2022), 108413. https://doi.org/10.1016/j.knosys.2022.108413 doi: 10.1016/j.knosys.2022.108413
    [63] Y. Yu, F. Q. Zhang, G. D. Yang, Y. Wang, J. P. Huang, Y. Y. Han, A discrete artificial bee colony method based on variable neighborhood structures for the distributed permutation flowshop problem with sequence-dependent setup times, Swarm Evol. Comput., 75 (2022), 101179. https://doi.org/10.1016/j.swevo.2022.101179 doi: 10.1016/j.swevo.2022.101179
    [64] V. Fernandez-Viagas, P. Perez-Gonzalez, J. M. Framinan, The distributed permutation flow shop to minimise the total flowtime, Comput. Ind. Eng., 118 (2018), 464–477. https://doi.org/10.1016/j.cie.2018.03.014 doi: 10.1016/j.cie.2018.03.014
    [65] A. Khare, S. Agrawal, Effective heuristics and metaheuristics to minimise total tardiness for the distributed permutation flowshop scheduling problem, Int. J. Prod. Res., 59 (2021), 7266–7282. https://doi.org/10.1080/00207543.2020.1837982 doi: 10.1080/00207543.2020.1837982
    [66] Y. Z. Li, Q. K. Pan, X. He, H. Y. Sang, K. Z. Gao, X. L. Jing, The distributed flowshop scheduling problem with delivery dates and cumulative payoffs, Comput. Ind. Eng., 165 (2022), 107961. https://doi.org/10.1016/j.cie.2022.107961 doi: 10.1016/j.cie.2022.107961
    [67] P. A. Villarinho, J. Panadero, L. S. Pessoa, A. A. Juan, F. L. C. Oliveira, A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs, Int. Trans. Oper. Res., 28 (2021), 716–737. https://doi.org/10.1111/itor.12862 doi: 10.1111/itor.12862
    [68] Q. Li, J. Li, X. Zhang, B. Zhang, A wale optimization algorithm for distributed flow shop with batch delivery, Soft Comput., 25 (2021), 1–14.
    [69] A. P. Rifai, H. T. Nguyen, S. Z. M. Dawal, Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling, Appl. Soft Comput., 40 (2016), 42–57. https://doi.org/10.1016/j.asoc.2015.11.034 doi: 10.1016/j.asoc.2015.11.034
    [70] J. Deng, L. Wang, A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem, Swarm Evol. Comput., 32 (2017), 121–131. https://doi.org/10.1016/j.swevo.2016.06.002 doi: 10.1016/j.swevo.2016.06.002
    [71] Z. Yan, R. Shi, K. Du, L. Yi, The role of green production process innovation in green manufacturing: empirical evidence from OECD countries, Appl. Econ., 54 (2022), 6755–6767. https://doi.org/10.1080/00036846.2022.2083569 doi: 10.1080/00036846.2022.2083569
    [72] C. Zhang, W. Ji, Digital twin-driven carbon emission prediction and low-carbon control of intelligent manufacturing job-shop, Procedia CIRP, 83 (2019), 624–629. https://doi.org/10.1016/j.procir.2019.04.095 doi: 10.1016/j.procir.2019.04.095
    [73] X. Wu, A. Che, Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search, Omega, 94 (2020), 102117–102117. https://doi.org/10.1016/j.omega.2019.102117 doi: 10.1016/j.omega.2019.102117
    [74] J. F. Chen, L. Wang, Z. P. Peng, A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling, Swarm Evol. Comput., 50 (2019), 100557–100557. https://doi.org/10.1016/j.swevo.2019.100557 doi: 10.1016/j.swevo.2019.100557
    [75] T. Meng, Q. K. Pan, L. Wang, A distributed permutation flowshop scheduling problem with the customer order constraint, Knowl. Based Syst., 184 (2019), 104894–104894. https://doi.org/10.1016/j.knosys.2019.104894 doi: 10.1016/j.knosys.2019.104894
    [76] K. Wang, Y. Huang, H. Qin, A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown, J. Oper. Res. Soc., 67 (2016), 68–82. https://doi.org/10.1057/jors.2015.50 doi: 10.1057/jors.2015.50
    [77] J. Y. Mao, Q. K. Pan, Z. H. Miao, L. Gao, An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance, Expert Syst. Appl., 169 (2021), 114495. https://doi.org/10.1016/j.eswa.2020.114495 doi: 10.1016/j.eswa.2020.114495
    [78] W. Shao, D. Pi, Z. Shao, Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms, Knowl. Based Syst., 137 (2017), 163–181. https://doi.org/10.1016/j.knosys.2017.09.026 doi: 10.1016/j.knosys.2017.09.026
    [79] S. W. Lin, K. C. Ying, Minimizing makespan for solving the distributed no-wait flowshop scheduling problem, Comput. Ind. Eng., 99 (2016), 202–209. https://doi.org/10.1016/j.cie.2016.07.027 doi: 10.1016/j.cie.2016.07.027
    [80] G. Zhang, K. Xing, Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion, Comput. Oper. Res., 108 (2019), 33–43. https://doi.org/10.1016/j.cor.2019.04.002 doi: 10.1016/j.cor.2019.04.002
    [81] F. Zhao, L. Zhao, L. Wang, H. Song, An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion, Expert Syst. Appl., 160 (2020), 113678. https://doi.org/10.1016/j.eswa.2020.113678 doi: 10.1016/j.eswa.2020.113678
    [82] X. Han, Y. Han, Q. Chen, J. Li, H. Sang, Y. Liu, et al., Distributed flow shop scheduling with sequence-dependent setup times using an improved iterated greedy algorithm, Complex Syst., 1 (2021), 198–217. https://doi.org/10.23919/CSMS.2021.0018 doi: 10.23919/CSMS.2021.0018
    [83] X. Han, Y. Han, B. Zhang, H. Qin, J. Li, Y. Liu, et al., An effective iterative greedy algorithm for distributed blocking flowshop scheduling problem with balanced energy costs criterion, Appl. Soft Comput., 129 (2022), 109502. https://doi.org/10.1016/j.asoc.2022.109502 doi: 10.1016/j.asoc.2022.109502
    [84] W. Shao, D. Pi, Z. Shao, A Pareto-based estimation of distribution algorithm for solving multiobjective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time, IEEE Trans. Autom. Sci. Eng., 16 (2019), 1344–1360. https://doi.org/10.1109/TASE.2018.2886303 doi: 10.1109/TASE.2018.2886303
    [85] J. P. Huang, Q. K. Pan, L. Gao, An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, Swarm Evol. Comput., 59 (2020), 100742. https://doi.org/10.1016/j.swevo.2020.100742 doi: 10.1016/j.swevo.2020.100742
    [86] J. P. Huang, Q. K. Pan, Z. H. Miao, L. Gao, Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times, Eng. Appl. Artif. Intell., 97 (2021), 104016. https://doi.org/10.1016/j.engappai.2020.104016 doi: 10.1016/j.engappai.2020.104016
    [87] T. Meng, Q. K. Pan, L. Wang, A distributed permutation flowshop scheduling problem with the customer order constraint, Knowl. Based Syst., 184 (2019), 104894. https://doi.org/10.1016/j.knosys.2019.104894 doi: 10.1016/j.knosys.2019.104894
    [88] S. Cai, K. Yang, K. Liu, Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints, J. Oper. Res. Soc. China, 6 (2018), 391–416. https://doi.org/10.1007/s40305-017-0165-3 doi: 10.1007/s40305-017-0165-3
    [89] S. Hatami, R. Ruiz, C. A. Romano, Two simple constructive algorithms for the distributed assembly permutation flowshop scheduling problem, in Managing Complexity: Challenges for Industrial Engineering and Operations Management, (2014), 139–145.
    [90] Q. K. Pan, L. Gao, L. X. Yu, F. M. Jose, Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem, Appl. Soft Comput., 81 (2019), 105492. https://doi.org/10.1016/j.asoc.2019.105492 doi: 10.1016/j.asoc.2019.105492
    [91] X. Li, X. Zhang, M. Yin, J. Wang, A genetic algorithm for the distributed assembly permutation flowshop scheduling problem, in 2015 IEEE Congress on Evolutionary Computation (CEC), IEEE, (2015), 3096–3101. https://doi.org/10.1109/CEC.2015.7257275
    [92] D. Ferone, S. Hatami, E. M. González‐Neira, A. A. Juan, P. Festa, A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem, Int. Trans. Oper. Res., 27 (2020), 1368–1391. https://doi.org/10.1111/itor.12719 doi: 10.1111/itor.12719
    [93] J. Lin, Z. J. Wang, X. Li, A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem, Swarm Evol. Comput., 36 (2017), 124–135. https://doi.org/10.1016/j.swevo.2017.04.007 doi: 10.1016/j.swevo.2017.04.007
    [94] G. Zhang, K. Xing, F. Cao, Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan, Int. J. Prod. Res., 56 (2018), 3226–3244. https://doi.org/10.1080/00207543.2017.1401241 doi: 10.1080/00207543.2017.1401241
    [95] J. Deng, L. Wang, S. Y. Wang, X. L. Zheng, A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem, Int. J. Prod. Res., 54 (2016), 3561–3577. https://doi.org/10.1080/00207543.2015.1084063 doi: 10.1080/00207543.2015.1084063
    [96] H. Y. Sang, Q. K. Pan, J. Q. Li, P. Wang, Y. Y. Han, K. Z. Gao, et al., Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion, Swarm Evol. Comput., 44 (2019), 64–73. https://doi.org/10.1016/j.swevo.2018.12.001 doi: 10.1016/j.swevo.2018.12.001
    [97] F. Zhao, X. Hu, L.Wang, Z. Li, A memetic discrete differential evolution algorithm for the distributed permutation flow shop scheduling problem, Complex Intell. Syst., 8 (2022), 141–161. https://doi.org/10.1007/s40747-021-00354-5 doi: 10.1007/s40747-021-00354-5
    [98] F. Xiong, K. Xing, Meta-heuristics for the distributed two-stage assembly scheduling problem with bi-criteria of makespan and mean completion time, Int. J. Prod. Res., 52 (2014), 2743–2766. https://doi.org/10.1080/00207543.2014.884290 doi: 10.1080/00207543.2014.884290
    [99] X. Wu, X. Liu, N. Zhao, An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem, Memet Comput., 11 (2019), 335–355. https://doi.org/10.1007/s12293-018-00278-7 doi: 10.1007/s12293-018-00278-7
    [100] Y. Y. Huang, Q. K. Pan, J. P. Huang, P. N. Suganthan, L. Gao, An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem, Comput. Ind. Eng., 152 (2021), 107021. https://doi.org/10.1016/j.cie.2020.107021 doi: 10.1016/j.cie.2020.107021
    [101] G. Wang, X. Li, L. Gao, P. Li, Energy-efficient distributed heterogeneous welding flow shop scheduling problem using a modified MOEA/D, Swarm Evol. Comput., 62 (2021), 100858. https://doi.org/10.1016/j.swevo.2021.100858 doi: 10.1016/j.swevo.2021.100858
    [102] G. Wang, X. Li, L. Gao, P. Li, An effective multi-objective whale swarm algorithm for energy-efficient scheduling of distributed welding flow shop, Ann. Oper. Res., 310 (2022), 223–255. https://doi.org/10.1007/s10479-021-03952-1 doi: 10.1007/s10479-021-03952-1
    [103] J. Cai, D. Lei, M. Li, A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop, Int. J. Prod. Res., 59 (2020), 1–18. https://doi.org/10.1080/00207543.2020.1780333 doi: 10.1080/00207543.2020.1780333
    [104] J. Cai, R. Zhou, D. Lei, Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks, Appl. Artif. Intell., 90 (2020), 103540–103540. https://doi.org/10.1016/j.engappai.2020.103540 doi: 10.1016/j.engappai.2020.103540
    [105] C. Lu, Q. Liu, B. Zhang, L. Yin, A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop, Expert Syst. Appl., 204 (2022), 117555. https://doi.org/10.1016/j.eswa.2022.117555 doi: 10.1016/j.eswa.2022.117555
    [106] H. Qin, T. Li, Y. Teng, K. Wang, Integrated production and distribution scheduling in distributed hybrid flow shops, Memet Comput., 13 (2021), 185–202. https://doi.org/10.1007/s12293-021-00329-6 doi: 10.1007/s12293-021-00329-6
    [107] C. Lu, L. Gao, J. Yi, X. Li, Energy-efficient scheduling of distributed flow shop with heterogeneous factories: A real-world case from automobile industry in China, IEEE Trans. Ind. Inf., 17 (2020), 6687–6696. https://doi.org/10.1109/TⅡ.2020.3043734 doi: 10.1109/TⅡ.2020.3043734
    [108] E. Jiang, L. Wang, J. Wang, Decomposition-based multi-objective optimization for energy-aware distributed hybrid flow shop scheduling with multiprocessor tasks, Tsinghua Sci. Technol., 26 (2021), 646–663. https://doi.org/10.26599/TST.2021.9010007 doi: 10.26599/TST.2021.9010007
    [109] J. Cai, D. Lei, A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time, Complex Intell. Syst., 7 (2021), 2235–2253. https://doi.org/10.1007/s40747-021-00400-2 doi: 10.1007/s40747-021-00400-2
    [110] J. Zheng, L. Wang, J. J. Wang, A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop, Knowl. Based Syst., 194 (2020), 105536. https://doi.org/10.1016/j.knosys.2020.105536 doi: 10.1016/j.knosys.2020.105536
    [111] J. J. Wang, L. Wang, A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop, IEEE Trans. Syst. Man Cybern.: Syst., 50 (2018), 1805–1819. https://doi.org/10.1109/TSMC.2017.2788879 doi: 10.1109/TSMC.2017.2788879
    [112] G. Zhang, K. Xing, Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion, Comput. Oper. Res., 108 (2019), 33–43. https://doi.org/10.1016/j.cor.2019.04.002 doi: 10.1016/j.cor.2019.04.002
    [113] C. Lu, Y. Huang, L. Meng, L. Gao, B. Zhang, J. Zhou, A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers, Robot Comput. Integr. Manuf., 74 (2022), 102277. https://doi.org/10.1016/j.rcim.2021.102277 doi: 10.1016/j.rcim.2021.102277
    [114] K. Geng, C. Ye, A memetic algorithm for energy-efficient distributed re-entrant hybrid flow shop scheduling problem, J. Intell. Fuzzy Syst., 41 (2021), 3951–3971. https://doi.org/10.3233/JIFS-202963 doi: 10.3233/JIFS-202963
    [115] J. Dong, C. Ye, Green scheduling of distributed two-stage reentrant hybrid flow shop considering distributed energy resources and energy storage system, Comput. Ind. Eng., 169 (2022), 108146. https://doi.org/10.1016/j.cie.2022.108146 doi: 10.1016/j.cie.2022.108146
    [116] Y. Alaouchiche, Y. Ouazene, F. Yalaoui, Economic and energetic performance evaluation of unreliable production lines: An integrated analytical approach, IEEE Access, 8 (2020), 185330–185345. https://doi.org/10.1109/ACCESS.2020.3029761 doi: 10.1109/ACCESS.2020.3029761
    [117] B. Naderi, A. Azab, Modeling and heuristics for scheduling of distributed job shops, Expert Syst. Appl., 41 (2014), 7754–7763. https://doi.org/10.1016/j.eswa.2014.06.023 doi: 10.1016/j.eswa.2014.06.023
    [118] M. L. R. Varela, G. D. Putnik, M. M. Cruz-Cunha, Web-based technologies integration for distributed manufacturing scheduling in a virtual enterprise, Int. J. Web Portals (IJWP), 4 (2012), 19–34. https://doi.org/10.4018/jwp.2012040102 doi: 10.4018/jwp.2012040102
    [119] H. Z. Jia, J. Y. Fuh, A. Y. Nee, Y. F. Zhang, Web-based multi-functional scheduling system for a distributed manufacturing environment, Concurr. Eng., 10 (2002), 27–39. https://doi.org/10.1177/1063293X02010001054 doi: 10.1177/1063293X02010001054
    [120] H. Z. Jia, A. Y. Nee, J. Y. Fuh, Y. F. Zhang, A modified genetic algorithm for distributed scheduling problems, J. Intell. Manuf., 14 (2003), 351–362. https://doi.org/10.1023/A:1024653810491 doi: 10.1023/A:1024653810491
    [121] H. Z. Jia, J. Y. Fuh, A. Y. Nee, Y. F. Zhang, Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems, Comput. Ind. Eng., 53 (2007), 313–320. https://doi.org/10.1016/j.cie.2007.06.024 doi: 10.1016/j.cie.2007.06.024
    [122] F. T. Chan, S. H. Chung, L. Y. Chan, G. Finke, M. K. Tiwari, Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach, Robot Comput. Integr. Manuf., 22 (2006), 493–504. https://doi.org/10.1016/j.rcim.2005.11.005 doi: 10.1016/j.rcim.2005.11.005
    [123] I. J. Jeong, S. B. Yim, A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time, Int. J. Prod. Res., 47 (2009), 6783–6805. https://doi.org/10.1080/00207540701824217 doi: 10.1080/00207540701824217
    [124] L. De Giovanni, F. Pezzella, An improved genetic algorithm for the distributed and flexible job-shop scheduling problem, Eur. J. Oper. Res., 200 (2010), 395–408. https://doi.org/10.1016/j.ejor.2009.01.008 doi: 10.1016/j.ejor.2009.01.008
    [125] P. Lou, S. K. Ong, A. Y. C. Nee, Agent-based distributed scheduling for virtual job shops, Int. J. Prod. Res., 48 (2010), 3889–3910. https://doi.org/10.1080/00207540902927918 doi: 10.1080/00207540902927918
    [126] B. Naderi, A. Azab, An improved model and novel simulated annealing for distributed job shop problems, J. Adv. Manuf. Technol., 81 (2015), 693–703. https://doi.org/10.1007/s00170-015-7080-8 doi: 10.1007/s00170-015-7080-8
    [127] T. K. Liu, Y. P. Chen, J. H. Chou, Solving distributed and flexible job-shop scheduling problems for a real-world fastener manufacturer, IEEE Access, 2 (2014), 1598–1606. https://doi.org/10.1109/ACCESS.2015.2388486 doi: 10.1109/ACCESS.2015.2388486
    [128] I. Chaouch, O. B. Driss, K. Ghedira, A novel dynamic assignment rule for the distributed job shop scheduling problem using a hybrid ant-based algorithm, Appl. Intell., 49 (2019), 1903–1924. https://doi.org/10.1007/s10489-018-1343-7 doi: 10.1007/s10489-018-1343-7
    [129] Q. Luo, Q. Deng, G. Gong, L. Zhang, W. Han, K. Li, An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers, Expert Syst. Appl., 160 (2020), 113721. https://doi.org/10.1016/j.eswa.2020.113721 doi: 10.1016/j.eswa.2020.113721
    [130] J. Q. Li, P. Duan, J. Cao, X. P. Lin, Y. Y. Han, A hybrid Pareto-based tabu search for the distributed flexible job shop scheduling problem with E/T criteria, IEEE Access, 6 (2018), 58883–58897. https://doi.org/10.1109/ACCESS.2018.2873401 doi: 10.1109/ACCESS.2018.2873401
    [131] F. T. Chan, S. H. Chung, P. L. Y. Chan, An adaptive genetic algorithm with dominated genes for distributed scheduling problems, Expert Syst. Appl., 29 (2005), 364–371. https://doi.org/10.1016/j.eswa.2005.04.009 doi: 10.1016/j.eswa.2005.04.009
    [132] L. Meng, C. Zhang, Y. Ren, B. Zhang, C. Lv, Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem, Comput. Ind. Eng., 142 (2020), 106347. https://doi.org/10.1016/j.cie.2020.106347 doi: 10.1016/j.cie.2020.106347
    [133] B. Marzouki, O. B. Driss, K. Ghédira, Solving distributed and flexible job shop scheduling problem using a chemical reaction optimization metaheuristic, Procedia Comput. Sci., 126 (2018), 1424–1433. https://doi.org/10.1016/j.procs.2018.08.114 doi: 10.1016/j.procs.2018.08.114
    [134] M. Zandieh, A. R. Khatami, S. H. A. Rahmati, Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm, Appl. Soft Comput., 58 (2017), 449–464. https://doi.org/10.1016/j.asoc.2017.04.060 doi: 10.1016/j.asoc.2017.04.060
    [135] P. H. Lu, M. C. Wu, H. Tan, Y. H. Peng, C. F. Chen, A genetic algorithm embedded with a concise chromosome representation for distributed and flexible job-shop scheduling problems, J. Intell. Manuf., 29 (2018), 19–34. https://doi.org/10.1007/s10845-015-1083-z doi: 10.1007/s10845-015-1083-z
    [136] M. C. Wu, C. S. Lin, C. H. Lin, C. F. Chen, Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems, Comput. Oper. Res., 80 (2017), 101–112. https://doi.org/10.1016/j.cor.2016.11.021 doi: 10.1016/j.cor.2016.11.021
    [137] H. C. Chang, T. K. Liu, Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms, J. Intell. Manuf., 28 (2017), 1973–1986. https://doi.org/10.1007/s10845-015-1084-y doi: 10.1007/s10845-015-1084-y
    [138] W. Xu, Y. Hu, W. Luo, L. Wang, R. Wu, A multi-objective scheduling method for distributed and flexible job shop based on hybrid genetic algorithm and tabu search considering operation outsourcing and carbon emission, Comput. Ind. Eng., 157 (2021), 107318. https://doi.org/10.1016/j.cie.2021.107318 doi: 10.1016/j.cie.2021.107318
    [139] L. Meng, Y. Ren, B. Zhang, J. Q. Li, H. Sang, C. Zhang, MILP modeling and optimization of energy-efficient distributed flexible job shop scheduling problem, IEEE Access, 8 (2020), 191191–191203. https://doi.org/10.1109/ACCESS.2020.3032548 doi: 10.1109/ACCESS.2020.3032548
    [140] S. Zhang, X. Li, B. Zhang, S. Wang, Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system, Eur. J. Oper. Res., 283 (2020), 441–460. https://doi.org/10.1016/j.ejor.2019.11.016 doi: 10.1016/j.ejor.2019.11.016
    [141] F. Xiong, K. Xing, Meta-heuristics for the distributed two-stage assembly scheduling problem with bi-criteria of makespan and mean completion time, Int. J. Prod. Res., 52 (2014), 2743–2766. https://doi.org/10.1080/00207543.2014.884290 doi: 10.1080/00207543.2014.884290
    [142] S. Yang, Z. Xu, The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery. Int. J. Prod. Res., 59 (2021), 4053-4071. https://doi.org/10.1080/00207543.2020.1757174 doi: 10.1080/00207543.2020.1757174
    [143] Z. Shao, W. Shao, D. Pi, Effective constructive heuristic and metaheuristic for the distributed assembly blocking flow-shop scheduling problem, Appl. Intell., 50 (2020), 4647–4669. https://doi.org/10.1007/s10489-020-01809-x doi: 10.1007/s10489-020-01809-x
    [144] W. Niu, J. Q. Li, A two-stage cooperative evolutionary algorithm for energy-efficient distributed group blocking flow shop with setup carryover in precast systems, Knowl. Based Syst., 257 (2022), 109890. https://doi.org/10.1016/j.knosys.2022.109890 doi: 10.1016/j.knosys.2022.109890
    [145] F. Jolai, H. Asefi, M. Rabiee, P. Ramezani, Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem, Sci. Iran., 20 (2013), 861–872. https://doi.org/10.1016/j.scient.2012.10.044 doi: 10.1016/j.scient.2012.10.044
    [146] J. Deng, L. Wang, S. Y. Wang, X. L. Zheng, A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem, Int. J. Prod. Res., 54 (2016), 3561–3577. https://doi.org/10.1080/00207543.2015.1084063 doi: 10.1080/00207543.2015.1084063
    [147] F. Nikzad, J. Rezaeian, I. Mahdavi, I. Rastgar, Scheduling of multi-component products in a two-stage flexible flow shop, Appl. Soft Comput., 32 (2015), 132–143. https://doi.org/10.1016/j.asoc.2015.03.006 doi: 10.1016/j.asoc.2015.03.006
    [148] A. Azadeh, M. Jeihoonian, B. M. Shoja, S. H. Seyedmahmoudi, An integrated neural network-simulation algorithm for performance optimisation of the bi-criteria two-stage assembly flow-shop scheduling problem with stochastic activities, Int. J. Prod. Res., 50 (2012), 7271–7284. https://doi.org/10.1080/00207543.2011.645511 doi: 10.1080/00207543.2011.645511
    [149] F. Zhao, D. Shao, L. Wang, T. Xu, N. Zhu, An effective water wave optimization algorithm with problem-specific knowledge for the distributed assembly blocking flow-shop scheduling problem, Knowl. Based Syst., 243 (2022), 108471. https://doi.org/10.1016/j.knosys.2022.108471 doi: 10.1016/j.knosys.2022.108471
    [150] G. Zhang, K. Xing, Memetic social spider optimization algorithm for scheduling two-stage assembly flowshop in a distributed environment, Comput. Ind. Eng., 125 (2018), 423–433. https://doi.org/10.1016/j.cie.2018.09.007 doi: 10.1016/j.cie.2018.09.007
    [151] D. Lei, B. Su, M. Li, Cooperated teaching-learning-based optimisation for distributed two-stage assembly flow shop scheduling, Int. J. Prod. Res., 59 (2021), 7232–7245. https://doi.org/10.1080/00207543.2020.1836422 doi: 10.1080/00207543.2020.1836422
    [152] N. Shoaardebili, P. Fattahi, Multi-objective meta-heuristics to solve three-stage assembly flow shop scheduling problem with machine availability constraints, Int. J. Prod. Res., 53 (2015), 944–968. https://doi.org/10.1080/00207543.2014.948575 doi: 10.1080/00207543.2014.948575
    [153] Y. Du, J. Q. Li, C. Luo, L. L. Meng, A hybrid estimation of distribution algorithm for distributed flexible job shop scheduling with crane transportations, Swarm Evol. Comput., 62 (2021), 100861. https://doi.org/10.1016/j.swevo.2021.100861 doi: 10.1016/j.swevo.2021.100861
    [154] X. Wu, X. Liu, N. Zhao, An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem, Memet. Comput., 11 (2019), 335–355. https://doi.org/10.1007/s12293-018-00278-7 doi: 10.1007/s12293-018-00278-7
    [155] G. Zhang, K. Xing, G. Zhang, Z. He, Memetic algorithm with meta-Lamarckian learning and simplex search for distributed flexible assembly permutation flowshop scheduling problem, IEEE Access, 8 (2020), 96115–96128. https://doi.org/10.1109/ACCESS.2020.2996305 doi: 10.1109/ACCESS.2020.2996305
  • This article has been cited by:

    1. Christos Gogos, Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming, 2023, 13, 2076-3417, 12562, 10.3390/app132312562
    2. María Sol Cavallieri, Elisabeth Viles, Jairo R. Montoya-Torres, Sustainable production scheduling: insights from real-life applications, 2024, 0953-7287, 1, 10.1080/09537287.2024.2389879
    3. Roderich Wallrath, Meik B. Franke, Integrating MILP, Discrete-Event Simulation, and Data-Driven Models for Distributed Flow Shop Scheduling Using Benders Cuts, 2024, 12, 2227-9717, 1772, 10.3390/pr12081772
    4. Xuan He, Quan-Ke Pan, Liang Gao, Janis S. Neufeld, Jatinder N.D. Gupta, Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times, 2024, 123, 03050483, 102997, 10.1016/j.omega.2023.102997
    5. Kuo-Ching Ying, Shih-Wei Lin, Kuan-Fu Chen, Minimising makespan in distributed assembly hybrid flowshop scheduling problems, 2024, 0020-7543, 1, 10.1080/00207543.2024.2383781
    6. Shunsheng Guo, Yanhui Huang, Jun Guo, Zhao Peng, Baigang Du, Modeling and optimization of batch scheduling problem considering the process granularity in shared manufacturing, 2025, 03608352, 111198, 10.1016/j.cie.2025.111198
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(3238) PDF downloads(367) Cited by(6)

Figures and Tables

Figures(13)  /  Tables(4)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog