The flexible job-shop scheduling problem (FJSP) with parallel batch processing machine (PBM) is one of those long-standing issues that needs cutting-edge approaches. It is a recent extension of standard flexible job shop scheduling problems. Despite their wide application and prevalence in practical production, it seems that current research on these types of combinatorial optimization problems remains limited and uninvestigated. More specifically, existing research mainly concentrates on the flow shop scenarios in parallel batch machines for job shop scheduling but few literature emphasis on the flexible job shop integration in these contexts. To directly address the above mentioned problems, this paper establishes an optimization model considering parallel batch processing machines, aiming to minimize the maximum completion time in operating and production environments. The proposed solution merges variable neighborhood search with multi-population genetic algorithms, conducting a neighborhood search on the elite population to reduce the likelihood of falling into local optima. Subsequently, its applicability was evaluated in computational experiments using real production scenarios from a partnering enterprise and extended datasets. The findings from the analyses indicate that the enhanced algorithm can decrease the objective value by as much as 15% compared to other standard algorithms. Importantly, the proposed approach effectively resolves flexible job shop scheduling problems involving parallel batch processing machines. The contribution of the research is providing substantial theoretical support for enterprise production scheduling.
The graph model for conflict resolution (GMCR) methodology was enhanced in this research for addressing cross-basin water pollution conflicts involving heterogeneous sanctions, as a more intuitive and straightforward definition for mixed unilateral improvements was proposed, followed by an integrated procedure for performing mixed stability analyses. Furthermore, the cross-border water pollution dispute that occurred in 2018 in Hongze Lake, China, is systematically modeled and strategically analyzed for the first time, using the improved GMCR method. In addition, an evolution analysis was carried out within the framework of GMCR for verifying the applicability of the eco-compensation mechanism in addressing cross-basin water pollution disputes. This case study demonstrates that the heterogeneity of sanctioning opponents could influence equilibrium outcomes and even change the evolution of conflict situations. Moreover, the developed novel approach is able to accurately predict the equilibrium outcomes of the conflict and provide more strategic insights and valuable findings in making effective conflict resolutions for solving cross-basin water pollution conflicts.
To deeply reveal the complex nature of consensus building from interests of the moderator and decision makers (DMs) simultaneously, we construct a super conflict grey target negotiation consensus model by considering the concept of bull’s-eye in the grey target theory and the DMs’ limited compromises and tolerance behaviors. To begin with, by taking the DMs’ opinions as bull’s-eyes and judging their similarity, we transform the consensus-reaching process into the negotiation process or negotiation-coordination process, and we construct two types of grey target consensus models. What’s more, based on DMs’ limited compromises and tolerance behaviors, we establish the optimized consensus models with limited compromises and tolerance behaviors. Finally, a case verifies the validity of the proposed consensus model. The results show that the model can fully express DMs’ risk-appetite attitude towards the consensus opinion and their tolerance towards adjustments without compensation, and obtain the consensus opinion, realizing the maximum group satisfaction level by considering interests of each individual and guaranteeing the maximum utilities of DMs in the negotiation process and the minimum consensus cost with the reasonable allocation and the maximum utilities of DMs and the moderator.