In recent decades, the flexible job shop scheduling problem (FJSP) has been widely studied. In the context of green manufacturing, objectives related to energy consumption and sustainability have emerged as essential components of the contemporary production landscape. These scheduling objectives present new obstacles for workshop coordination, routing, and process planning. Among various green scheduling targets, energy consumption objectives constitute a substantial share. Therefore, this paper focuses on the dynamic flexible job shop scheduling problem (DFJSP) with an emphasis on energy consumption. First, this paper reviews the literature on DFJSP that considers energy consumption over the past decade. Second, this paper categorizes the dynamic constraints and dynamic event handling strategies in the indexed literature. Additionally, this paper examines the current methods for addressing this complex scheduling problem and compares and evaluates their advantages and disadvantages. Finally, this paper proposes new insights for future research from the perspectives of algorithms and energy-saving strategies.
The Line Balancing Problem (LBP) is a classic optimization topic in production management, aiming to improve efficiency through task allocation. With the transformation of the manufacturing industry towards intelligence, customization, and sustainability, its research scope has been significantly expanded. This study systematically reviews the recent research progress and proposes the C|H|V|E framework to analyze the LBP in four dimensions: (i) extension of the core line problem; (ii) horizontal integration with shop-floor decision-making; (iii) vertical coordination with enterprise-level operations; and (iv) extension of the value from efficiency improvement to sustainability and resilience enhancement. The review focuses on emerging trends, including artificial intelligence and data-driven approaches, digital twin-based optimization, flexible human-machine collaboration, and system integration across the lifecycle and circular economy. This paper provides a systematic overview of the current state of LBP research and explains how it continues to expand its boundaries by incorporating knowledge from new fields.
Gene expression programming (GEP) is frequently used to create intelligent dispatching rules for job-shop scheduling. The proper selection of the terminal set is a critical factor for the success of GEP. However, there are various job features and machine features that can be included in the terminal sets to capture the different characteristics of the job-shop state. Moreover, the importance of features in the terminal set varies greatly between scenarios. The irrelevant and redundant features may lead to high computational requirements and increased difficulty in interpreting generated rules. Consequently, a feature selection approach for evolving dispatching rules with improved GEP has been proposed, so as to select the proper terminal set for different dynamic job-shop scenarios. First, the adaptive variable neighborhood search algorithm was embedded into the GEP to obtain a diverse set of good rules for job-shop scenarios. Secondly, based on the fitness of the good rules and the contribution of features to the rules, a weighted voting ranking method was used to select features from the terminal set. The proposed approach was then compared with GEP-based algorithms and benchmark rules in the different job-shop conditions and scheduling objectives. The experimentally obtained results illustrated that the performance of the dispatching rules generated using the improved GEP algorithm after the feature selection process was better than that of both the baseline dispatching rules and the baseline GEP algorithm.