Xinyue Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Xinyue Wang has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Danyu Bai
School of Maritime Economics and Management, Dalian Maritime University, Dalian, China
5 shared publications - Tao Ren
Software College, Northeastern University, Shenyang, China
5 shared publications - Feng Chu
IBISC, Univ Evry, University of Paris-Saclay, Evry, France
3 shared publications - Baoyun Zhao2 shared publications
- Chin-Chia Wu
Department of Statistics, Feng Chia University, Taichung, Taiwan
2 shared publications Fanchun Meng
2 shared publications
Latest Publications
- Open Access
- 17 June 2026
- Published by Elsevier in SSRN Electronic Journal
A novel scheduling framework for balancing electricity cost and customer satisfaction in OEM production under time-of-use electricity tariffs
Original equipment manufacturers (OEMs) produce parts and components for multiple brand clients, making customer satisfaction essential to business competitiveness. In energy-intensive industries such as machinery manufacturing, electronics assembly, and photovoltaic production, automated flow-line systems generate substantial electricity demand, making electricity expenditure a critical operational and economic concern. Time-of-use (ToU) electricity tariffs provide OEMs with an opportunity to reduce energy costs by shifting production from high-price to low-price periods. However, tariff-responsive scheduling may delay order completion and weaken customer-oriented service performance, especially for high-value customers. To address this conflict, this study proposes a novel scheduling framework for improving cost efficiency and customer service in OEM production under ToU tariffs. The framework evaluates customer requirements from a global production perspective by integrating customer value weights, shared production resources, and electricity price fluctuations into a unified scheduling model. The problem is formulated as a bi-objective multi-agent flow shop scheduling problem that minimizes total electricity cost and a value-weighted completion-time measure used as a proxy for customer satisfaction. A multi-objective bacterial foraging optimization (MO_BFO) algorithm is developed by integrating B&B-based initialization, optimality-inspired strategies, and tariff-aware shifting operations. Numerical experiments and an industrial PV cell case show that MO_BFO reduces total electricity cost by 17.0% and improves the service measure by 10.2% compared with FCFS.
- 17 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA novel scheduling framework for balancing electricity cost and customer satisfaction in OEM production under time-of-use electricity tariffs
Original equipment manufacturers (OEMs) produce parts and components for multiple brand clients, making customer satisfaction essential to business competitiveness. In energy-intensive industries such as machinery manufacturing, electronics assembly, and photovoltaic production, automated flow-line systems generate substantial electricity demand, making electricity expenditure a critical operational and economic concern. Time-of-use (ToU) electricity tariffs provide OEMs with an opportunity to reduce energy costs by shifting production from high-price to low-price periods. However, tariff-responsive scheduling may delay order completion and weaken customer-oriented service performance, especially for high-value customers. To address this conflict, this study proposes a novel scheduling framework for improving cost efficiency and customer service in OEM production under ToU tariffs. The framework evaluates customer requirements from a global production perspective by integrating customer value weights, shared production resources, and electricity price fluctuations into a unified scheduling model. The problem is formulated as a bi-objective multi-agent flow shop scheduling problem that minimizes total electricity cost and a value-weighted completion-time measure used as a proxy for customer satisfaction. A multi-objective bacterial foraging optimization (MO_BFO) algorithm is developed by integrating B&B-based initialization, optimality-inspired strategies, and tariff-aware shifting operations. Numerical experiments and an industrial PV cell case show that MO_BFO reduces total electricity cost by 17.0% and improves the service measure by 10.2% compared with FCFS.
- 10 June 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 181
Prototype-driven contrastive learning enables transferable seismic representation
- 10 June 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 181
Prototype-driven contrastive learning enables transferable seismic representation
- Open Access
- 9 June 2026
- Published by Elsevier in SSRN Electronic Journal
Reinforcement Learning-Guided MOEA/D for Energy-Efficient Flow Shop Scheduling under Time-of-Use Electricity Tariffs
Energy-intensive manufacturing systems are increasingly exposed to volatile electricity prices and stringent sustainability requirements, making energy-aware scheduling a key operational lever for cost reduction and emission mitigation without additional capital investment. In many practical production environments, manufacturing activities are structured as tightly coupled flow-line systems, and energy-related decisions at one stage propagate across the entire process. This study investigates an energy-efficient flow shop scheduling problem under time-of-use (ToU) electricity tariffs, in which the makespan, total energy consumption, and total electricity cost are optimized simultaneously. To address the strong coupling among job sequencing, tariff-aware period assignment, and machine power-mode selection, a reinforcement learning–guided multi-objective evolutionary algorithm based on decomposition (RL-MOEA/D) is proposed. The algorithm adopts a three-dimensional encoding scheme and a graph-based decoding mechanism to expose critical temporal, energy, and tariff-related structures. Different from existing MOEA/D variants with fixed operator-selection strategies, the proposed method formulates the low-level refinement of period deferral and power-mode decisions as a Markov decision process and employs a dueling double deep Q-network to adaptively select specific operators based on structured state representation and ToU price sensitivity. A set of right-shift strategies is developed to systematically exploit temporal flexibility in feasible schedules, either by reducing standby energy or reallocating energy-intensive operations. Computational experiments and an industrial case study demonstrate that the proposed approach significantly outperforms state-of-the-art algorithms in terms of convergence quality, solution diversity, and dominance performance.
- 9 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessReinforcement Learning-Guided MOEA/D for Energy-Efficient Flow Shop Scheduling under Time-of-Use Electricity Tariffs
Energy-intensive manufacturing systems are increasingly exposed to volatile electricity prices and stringent sustainability requirements, making energy-aware scheduling a key operational lever for cost reduction and emission mitigation without additional capital investment. In many practical production environments, manufacturing activities are structured as tightly coupled flow-line systems, and energy-related decisions at one stage propagate across the entire process. This study investigates an energy-efficient flow shop scheduling problem under time-of-use (ToU) electricity tariffs, in which the makespan, total energy consumption, and total electricity cost are optimized simultaneously. To address the strong coupling among job sequencing, tariff-aware period assignment, and machine power-mode selection, a reinforcement learning–guided multi-objective evolutionary algorithm based on decomposition (RL-MOEA/D) is proposed. The algorithm adopts a three-dimensional encoding scheme and a graph-based decoding mechanism to expose critical temporal, energy, and tariff-related structures. Different from existing MOEA/D variants with fixed operator-selection strategies, the proposed method formulates the low-level refinement of period deferral and power-mode decisions as a Markov decision process and employs a dueling double deep Q-network to adaptively select specific operators based on structured state representation and ToU price sensitivity. A set of right-shift strategies is developed to systematically exploit temporal flexibility in feasible schedules, either by reducing standby energy or reallocating energy-intensive operations. Computational experiments and an industrial case study demonstrate that the proposed approach significantly outperforms state-of-the-art algorithms in terms of convergence quality, solution diversity, and dominance performance.
- 8 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Optimizing customer satisfaction and energy costs for flow shop scheduling
Optimisation de la satisfaction client et des coûts énergétiques pour les problèmes d'ordonnancement flowshop: Les problèmes de planification liés aux tarifs multi-agents et au temps d'utilisation de l'électricité sont devenus des sujets de recherche d'actualité pour améliorer la satisfaction des clients et équilibrer l'offre et la demande en électricité. Les existant travaux révèlent que : 1) la plupart des problèmes d'ordonnancement se concentrent sur des configurations bi-agents ; 2) la plupart des recherches sur l'ordonnancement dans le cadre des tarifs horaires limitent aux machines uniques ou parallèles ou aux ateliers simplifiés ; et 3) très peu d'études prennent en compte des hypothèses réalistes, telles que les arrivées des tâches et les dates d'échéance souhaitées par les clients. Pour combler ces lacunes, cette thèse explore trois nouveaux problèmes d'ordonnancement flowshop qui intégrant successivement l'aspect de multi-agents et de tarifs horaires de l'électricité, tout en prenant en compte des hypothèses réalistes telles que les dates disponibles de tâches, les dates d'échéance et les activités de maintenance. Premièrement, un problème d'ordonnancement de flowshop et multi-agents avec dates de disponibilité et sous deux scénarios est étudié. L'objectif est de minimiser le temps total de réalisation des agents et le retard maximum. Pour obtenir une solution optimale pour les instances de petite taille, un algorithme de séparation et évaluation combinant des bornes inférieures et des stratégies d'élagage est développé. Pour les instances de taille moyenne, un algorithme co-évolutif intégrant des techniques d'apprentissage par renforcement est proposé pour obtenir des solutions proches d'optimum. Des expériences numériques démontrent l'efficacité des méthodes proposées.Deuxièmement, un bi-objectif problème d'ordonnancement de flowshop avec tarifs horaires de l'électricité est adressé. L'objectif est de trouver le meilleur compromis entre le coût total de l'électricité et le retard maximum. Basé sur l'analyse du problème, des inégalités valides sont conçues pour réduire l'espace de recherche.Ensuite, une méthode de contrainte ε combinant taille de pas maximale et stratégie d'inversion est proposée pour obtenir le front de Pareto. Pour les instances de taille moyenne et grande, un algorithme d'optimisation des mouches à fruits en deux étapes est appliqué pour obtenir un front de approché. Les performances des algorithmes proposés sont évaluées à travers diverses expériences numériques.Enfin, un problème d'ordonnancement de flowshop et multi-agents avec tarifs horaires de l'électricité est étudié. L'objectif est de minimiser le temps total de réalisation des agents et le coût total de l'électricité, simultanément. Un nouveau algorithme de séparation et évaluation est conçu pour résoudre le problème, dans lequel une stratégie de branchement à deux nœuds et des règles d'élagage sont fournies pour réduire efficacement le temps de calcul. La performance de l'algorithme proposé est évaluée en comparant les résultats proposés par un solveur commercial CPLEX.
- 8 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Optimizing customer satisfaction and energy costs for flow shop scheduling
Optimisation de la satisfaction client et des coûts énergétiques pour les problèmes d'ordonnancement flowshop: Les problèmes de planification liés aux tarifs multi-agents et au temps d'utilisation de l'électricité sont devenus des sujets de recherche d'actualité pour améliorer la satisfaction des clients et équilibrer l'offre et la demande en électricité. Les existant travaux révèlent que : 1) la plupart des problèmes d'ordonnancement se concentrent sur des configurations bi-agents ; 2) la plupart des recherches sur l'ordonnancement dans le cadre des tarifs horaires limitent aux machines uniques ou parallèles ou aux ateliers simplifiés ; et 3) très peu d'études prennent en compte des hypothèses réalistes, telles que les arrivées des tâches et les dates d'échéance souhaitées par les clients. Pour combler ces lacunes, cette thèse explore trois nouveaux problèmes d'ordonnancement flowshop qui intégrant successivement l'aspect de multi-agents et de tarifs horaires de l'électricité, tout en prenant en compte des hypothèses réalistes telles que les dates disponibles de tâches, les dates d'échéance et les activités de maintenance. Premièrement, un problème d'ordonnancement de flowshop et multi-agents avec dates de disponibilité et sous deux scénarios est étudié. L'objectif est de minimiser le temps total de réalisation des agents et le retard maximum. Pour obtenir une solution optimale pour les instances de petite taille, un algorithme de séparation et évaluation combinant des bornes inférieures et des stratégies d'élagage est développé. Pour les instances de taille moyenne, un algorithme co-évolutif intégrant des techniques d'apprentissage par renforcement est proposé pour obtenir des solutions proches d'optimum. Des expériences numériques démontrent l'efficacité des méthodes proposées.Deuxièmement, un bi-objectif problème d'ordonnancement de flowshop avec tarifs horaires de l'électricité est adressé. L'objectif est de trouver le meilleur compromis entre le coût total de l'électricité et le retard maximum. Basé sur l'analyse du problème, des inégalités valides sont conçues pour réduire l'espace de recherche.Ensuite, une méthode de contrainte ε combinant taille de pas maximale et stratégie d'inversion est proposée pour obtenir le front de Pareto. Pour les instances de taille moyenne et grande, un algorithme d'optimisation des mouches à fruits en deux étapes est appliqué pour obtenir un front de approché. Les performances des algorithmes proposés sont évaluées à travers diverses expériences numériques.Enfin, un problème d'ordonnancement de flowshop et multi-agents avec tarifs horaires de l'électricité est étudié. L'objectif est de minimiser le temps total de réalisation des agents et le coût total de l'électricité, simultanément. Un nouveau algorithme de séparation et évaluation est conçu pour résoudre le problème, dans lequel une stratégie de branchement à deux nœuds et des règles d'élagage sont fournies pour réduire efficacement le temps de calcul. La performance de l'algorithme proposé est évaluée en comparant les résultats proposés par un solveur commercial CPLEX.
- Open Access
- 21 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 153-157
Design of an intelligent information management system for an underground car park
- 21 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 153-157
Open AccessDesign of an intelligent information management system for an underground car park
- 2 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 7679-7695
Bi-Objective Optimization of a Flow Shop Scheduling Problem Under Time-of-Use Tariffs
Time-of-use (ToU) tariffs flexibly offer markedly cheap electricity prices to industrial and residential users during off-peak periods, encouraging them to shift their peak electricity demands in valley periods. Although ToU tariffs play a crucial role in balancing electricity supply and demand, especially in energy-intensive industries, the best trade-off between industrial performance and energy costs has not been well explored. Manufacturing consumes a substantial amount of energy, primarily in the form of electricity, leading to imbalances in power consumption. The flow shop scheduling (FSS) model is one of the most prevalent models in manufacturing. To explore the significant role of ToU tariffs in manufacturing, this study addresses a bi-objective FSS problem under ToU tariffs. The objective is to find the optimal balance between customer satisfaction and total electricity cost. A tight mixed integer programming model is developed to solve this NP-hard problem using business optimizers. On the bases of the problem properties demonstrated in this study, valid inequalities are designed to reduce the solution space of the problem. For small-scale instances, an improved $\varepsilon $ -constraint method is presented to find the Pareto front. For medium and large-scale instances, a two-stage fruit fly optimization (TFFO) algorithm is developed to obtain the near Pareto front. Experimental results demonstrate the efficiency and effectiveness of the proposed model and algorithms. Note to Practitioners —Scheduling for complex systems remains a formidable challenge in manufacturing. Energy cost saving is a major objective for all energy-intensive industries. Effective scheduling is crucial for businesses achieving eco-friendly performance, especially under ToU tariffs. This study aims to provide efficient scheduling model and methods that can guide decision-makers in fostering ecological transitions. The $\varepsilon $ -constraint method can find globally optimal solutions within given constraints. This situation is particularly beneficial for small-scale production systems requiring high accuracy. The TFFO algorithm can handle complex industrial environments and enhance production efficiency. Additionally, the TFFO algorithm is flexible and extensible, enabling it to be generalized to other production scenarios. Overall, the proposed model and algorithms lay a solid foundation for achieving efficient scheduling under ToU tariffs.
- 2 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 7679-7695
Bi-Objective Optimization of a Flow Shop Scheduling Problem Under Time-of-Use Tariffs
Time-of-use (ToU) tariffs flexibly offer markedly cheap electricity prices to industrial and residential users during off-peak periods, encouraging them to shift their peak electricity demands in valley periods. Although ToU tariffs play a crucial role in balancing electricity supply and demand, especially in energy-intensive industries, the best trade-off between industrial performance and energy costs has not been well explored. Manufacturing consumes a substantial amount of energy, primarily in the form of electricity, leading to imbalances in power consumption. The flow shop scheduling (FSS) model is one of the most prevalent models in manufacturing. To explore the significant role of ToU tariffs in manufacturing, this study addresses a bi-objective FSS problem under ToU tariffs. The objective is to find the optimal balance between customer satisfaction and total electricity cost. A tight mixed integer programming model is developed to solve this NP-hard problem using business optimizers. On the bases of the problem properties demonstrated in this study, valid inequalities are designed to reduce the solution space of the problem. For small-scale instances, an improved $\varepsilon $ -constraint method is presented to find the Pareto front. For medium and large-scale instances, a two-stage fruit fly optimization (TFFO) algorithm is developed to obtain the near Pareto front. Experimental results demonstrate the efficiency and effectiveness of the proposed model and algorithms. Note to Practitioners —Scheduling for complex systems remains a formidable challenge in manufacturing. Energy cost saving is a major objective for all energy-intensive industries. Effective scheduling is crucial for businesses achieving eco-friendly performance, especially under ToU tariffs. This study aims to provide efficient scheduling model and methods that can guide decision-makers in fostering ecological transitions. The $\varepsilon $ -constraint method can find globally optimal solutions within given constraints. This situation is particularly beneficial for small-scale production systems requiring high accuracy. The TFFO algorithm can handle complex industrial environments and enhance production efficiency. Additionally, the TFFO algorithm is flexible and extensible, enabling it to be generalized to other production scenarios. Overall, the proposed model and algorithms lay a solid foundation for achieving efficient scheduling under ToU tariffs.
- 13 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-11
SeisParaNet: A Novel Multitask Network for Seismic Source Characterization in Earthquake Early Warning
Rapid and accurate seismic source characterization significantly influences the performance of Earthquake Early Warning (EEW) systems. However, the complexity of the seismic source modeling and the error accumulation during continuous characterization make it difficult to accurately characterize various source parameters. Furthermore, current artificial intelligence methods focus on a single task, lacking inter-task fusion and guidance from specialized knowledge. In this study, we propose a novel Deep Learning (DL) algorithm (SeisParaNet) to estimate P-wave arrival time, source location, and magnitude simultaneously based on a multi-task framework. To exploit seismological knowledge and attenuate the strong inter-task dependencies, this study incorporates arrival time differences information into the analysis of source localization parameters by using the attention mechanism and incorporates source location features into estimating local magnitude (ML). In addition, SeisParaNet uses a probability-based Self-Attention mechanism (Prob-Attention) to extract temporal information from waveforms. Experimental results demonstrate that, following a limited number of trainings on the STanford EArthquake Dataset (STEAD), SeisParaNet exhibits the capability to capture complex seismic patterns and rapidly characterize seismic sources. Furthermore, the introduction of Prob-Attention reduces computational complexity by 67%, validating the potential of SeisParaNet in EEW applications.
- 13 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-11
SeisParaNet: A Novel Multitask Network for Seismic Source Characterization in Earthquake Early Warning
Rapid and accurate seismic source characterization significantly influences the performance of Earthquake Early Warning (EEW) systems. However, the complexity of the seismic source modeling and the error accumulation during continuous characterization make it difficult to accurately characterize various source parameters. Furthermore, current artificial intelligence methods focus on a single task, lacking inter-task fusion and guidance from specialized knowledge. In this study, we propose a novel Deep Learning (DL) algorithm (SeisParaNet) to estimate P-wave arrival time, source location, and magnitude simultaneously based on a multi-task framework. To exploit seismological knowledge and attenuate the strong inter-task dependencies, this study incorporates arrival time differences information into the analysis of source localization parameters by using the attention mechanism and incorporates source location features into estimating local magnitude (ML). In addition, SeisParaNet uses a probability-based Self-Attention mechanism (Prob-Attention) to extract temporal information from waveforms. Experimental results demonstrate that, following a limited number of trainings on the STanford EArthquake Dataset (STEAD), SeisParaNet exhibits the capability to capture complex seismic patterns and rapidly characterize seismic sources. Furthermore, the introduction of Prob-Attention reduces computational complexity by 67%, validating the potential of SeisParaNet in EEW applications.
- 11 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (1) , 365-378
Hybrid Flow Shop Scheduling With Learning Effects and Release Dates to Minimize the Makespan
The hybrid flow shop scheduling (HFS) model has significant practical applicability in fields, such as manufacturing, transportation, service, and communication. However, learning effects, refer to the phenomenon of processors spending less processing time with more familiar operations, which are common constraints in actual production while often ignored in HFS research despite their significant impact on processing efficiency. In this article, an HFS problem with learning effects and release dates is investigated from a practical application perspective. For large-scale instances, a dispatching rule-based heuristic is developed with theoretical performance guarantees by demonstrating the asymptotic optimality and the tight worst-case bound. For small-scale instances, a branch-and-boun3d algorithm is designed to obtain an exact solution. An elaborate branching scheme, an idle-time-based pruning rule, and a task-splitting-based lower bound effectively reduce the search space. For medium-scale instances, a hybrid shuffled frog-leaping algorithm combined with macro evolution and local intensification is presented to search for high-quality solutions. Extensive experiments demonstrate the superiority of the developed algorithms against the state-of-the-art algorithms.
- 11 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (1) , 365-378
Hybrid Flow Shop Scheduling With Learning Effects and Release Dates to Minimize the Makespan
The hybrid flow shop scheduling (HFS) model has significant practical applicability in fields, such as manufacturing, transportation, service, and communication. However, learning effects, refer to the phenomenon of processors spending less processing time with more familiar operations, which are common constraints in actual production while often ignored in HFS research despite their significant impact on processing efficiency. In this article, an HFS problem with learning effects and release dates is investigated from a practical application perspective. For large-scale instances, a dispatching rule-based heuristic is developed with theoretical performance guarantees by demonstrating the asymptotic optimality and the tight worst-case bound. For small-scale instances, a branch-and-boun3d algorithm is designed to obtain an exact solution. An elaborate branching scheme, an idle-time-based pruning rule, and a task-splitting-based lower bound effectively reduce the search space. For medium-scale instances, a hybrid shuffled frog-leaping algorithm combined with macro evolution and local intensification is presented to search for high-quality solutions. Extensive experiments demonstrate the superiority of the developed algorithms against the state-of-the-art algorithms.
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3894-3899
Integrated Tractor and Trailer Scheduling for Airport Baggage Transport Service
Airport baggage transport is a key aspect of airport ground handling which involves transporting passenger baggage between the baggage handling center and aircraft stands. Typically, tractors and trailers are used to implement the baggage transport service under the drop-and-pull mode in practice. Efficient airport baggage transport service is essential to reduce flight delays, save airport ground handling costs, and guarantee aviation safety. However, the existing methods for scheduling tractors and trailers perform poorly when dealing with high flight volumes at busy hub airports, leading to delayed responses for baggage transport demands. Besides, few works have explored the significance of the drop-and-pull mode in improving airport baggage transport service equality. Thus, to enhance the efficiency of airport baggage transport service and reduce airport ground handling costs, this paper presents an integrated tractor and trailer scheduling problem under the drop-and-pull mode. Then, an improved Genetic Algorithm (GA) is developed to solve this problem. Finally, simulation experiments are conducted to verify the effectiveness of the model and algorithm.
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3894-3899
Integrated Tractor and Trailer Scheduling for Airport Baggage Transport Service
Airport baggage transport is a key aspect of airport ground handling which involves transporting passenger baggage between the baggage handling center and aircraft stands. Typically, tractors and trailers are used to implement the baggage transport service under the drop-and-pull mode in practice. Efficient airport baggage transport service is essential to reduce flight delays, save airport ground handling costs, and guarantee aviation safety. However, the existing methods for scheduling tractors and trailers perform poorly when dealing with high flight volumes at busy hub airports, leading to delayed responses for baggage transport demands. Besides, few works have explored the significance of the drop-and-pull mode in improving airport baggage transport service equality. Thus, to enhance the efficiency of airport baggage transport service and reduce airport ground handling costs, this paper presents an integrated tractor and trailer scheduling problem under the drop-and-pull mode. Then, an improved Genetic Algorithm (GA) is developed to solve this problem. Finally, simulation experiments are conducted to verify the effectiveness of the model and algorithm.
- 17 March 2023
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 62 (1-2) , 421-443
Scheduling a multi-agent flow shop with two scenarios and release dates
Cloud computing is widely applied in modern industrial areas due to its technological advancement, cost reduction, and applicability. Packets (tasks) belonging to different applications (agents) compete to share the common cloud resource through a series of edge nodes (processors) in pursuit of fast transmission. This paper abstracts the cloud computing system as a multi-agent flow-shop scheduling (MAFS) problem. The objective is to minimise the total completion time of several agents with the restriction that the maximum lateness cannot exceed a given bound. Given the complexity of the considered problem, a branch and bound algorithm combined with several pruning rules and lower bounds is proposed to obtain optimal solutions. Furthermore, the considered problem is generalised to a bi-scenario version, and a bi-population cooperative co-evolutionary (BCCE) algorithm is proposed to solve it. A reinforcement learning-based method is presented to generate the initial population. Several problem-specific intensification strategies are constructed to explore promising solutions. Comprehensive experiments verified the effectiveness of the proposed algorithms. The industrial data from the China Earthquake Network Centre further confirmed the superiority of the BCCE algorithm. Overall, the MAFS model and the proposed algorithms effectively enhance the user experience and reasonably guarantee revenue.
- 17 March 2023
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 62 (1-2) , 421-443
Scheduling a multi-agent flow shop with two scenarios and release dates
Cloud computing is widely applied in modern industrial areas due to its technological advancement, cost reduction, and applicability. Packets (tasks) belonging to different applications (agents) compete to share the common cloud resource through a series of edge nodes (processors) in pursuit of fast transmission. This paper abstracts the cloud computing system as a multi-agent flow-shop scheduling (MAFS) problem. The objective is to minimise the total completion time of several agents with the restriction that the maximum lateness cannot exceed a given bound. Given the complexity of the considered problem, a branch and bound algorithm combined with several pruning rules and lower bounds is proposed to obtain optimal solutions. Furthermore, the considered problem is generalised to a bi-scenario version, and a bi-population cooperative co-evolutionary (BCCE) algorithm is proposed to solve it. A reinforcement learning-based method is presented to generate the initial population. Several problem-specific intensification strategies are constructed to explore promising solutions. Comprehensive experiments verified the effectiveness of the proposed algorithms. The industrial data from the China Earthquake Network Centre further confirmed the superiority of the BCCE algorithm. Overall, the MAFS model and the proposed algorithms effectively enhance the user experience and reasonably guarantee revenue.