This work establishes a polynomial equivalence between JSC and a variant of the resource-constrained job shop problem with unit-capacity resources and proposes a genetic algorithm using permutation-with-repetition encoding and active, non-delay, and hybrid schedule evaluation procedures.
Abstract
We study the job shop scheduling problem with a conflict graph, in which adjacent jobs cannot be processed simultaneously on different machines, with the objective of minimizing the makespan. We establish a polynomial equivalence with a resource-constrained job shop problem having unit-capacity resources and binary resource requirements The problem is strongly NP-hard even on two machines with unit-time operations. For this setting, we derive an optimal-makespan formula and a linear-time algorithm when the conflict graph is a cluster graph, given the clique partition. We also develop a polynomial-time $4/3$-approximation algorithm for arbitrary conflict graphs on two machines when each job has exactly two unit-time operations. For the general problem, we propose four mixed-integer linear formulations, lower bounds, and a genetic algorithm with active, non-delay, and hybrid decoding procedures. Computational experiments on instances derived from the Lawrence and Taillard benchmarks and on randomly generated generalized job shop instances evaluate the proposed methods and show that the genetic algorithm generally improves on constructive heuristics.
This paper develops the first exact SAT and constraint programming (CP) formulations for the JSPPR, and provides corrected optimal makespans and a complete set of certified optimal results for the JSPPR benchmark, establishing a reliable reference for future studies.
H. Nguyen, Duc Trung Nguyen, Khanh To Van· 0 citations
The hybrid flow shop scheduling problem (HFSP) with unrelated parallel machines (UPMs), sequence-dependent setup times (SDSTs), and inter-stage transportation times has recently emerged as a prominent research topic. To address this scheduling problem with the objective of minimizing the maximum completion time (makesp...
These findings demonstrate the effectiveness and adaptability of the proposed framework for energy-aware flexible job shop scheduling and show that the BLDMA framework achieves better non-dominated solution sets on the tested instances.
Jia-Yu Liu, Juin-Han Chen, Hai-Yang Liu et al.· International Journal of Ind...· 0 citations
Modern manufacturing enterprises are increasingly transitioning to multi-variety, small-batch production. This shift introduces significant scheduling challenges, particularly due to the job hierarchy constraints inherent in assembling multi-level intermediate parts. Furthermore, non-machining preparation times—such as...
We study nonpreemptive scheduling on a single machine with release dates, due dates, positive job weights, and a common processing time. The objective is to minimize total weighted tardiness. Although closely related equal-processing-time problems admit polynomial-time algorithms, the complexity of this problem has rem...
Zhi-Long Chen, Nicholas G. Hall· arXiv.org· 0 citations
Experimental results show that the improved algorithm achieves an optimal Makespan value of 190 in dynamic disturbance scenarios and exhibits strong robustness, providing an efficient and feasible solution for job shop scheduling in complex production environments.
Jianguo Du, Chengkun Li, Zijie Tang· ITM Web of Conferences· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.