This paper aims at linking the work presented in Dauzère-Pérès et al. (1998) and more recently Kasapidis (2021) on multiresource flexible job-shop scheduling problem with nonlinear routes or equivalently arbitrary precedence graphs. In particular, we present a mixed integer linear programming (MIP) model constraint (CP) to formulate problem. We also compare theorems introduced propose new theor...

The flexible job shop scheduling problem (FJSP) is an extension of the classical and one more well-known NP-hard problems. To get better global optima FJSP, a novel hybrid whale optimization algorithm (HWOA) proposed for solving in which minimizing makespan considered as objective. Firstly, uniformity extensiveness initial population distribution are increased with good point set (GPS). Secondl...

We consider a three-stage dynamic flexible flow shop scheduling problem in which jobs of multiple types arrive dynamically over time, a quality feedback mechanism is present, and the setup timing and the process defect rate are closely related. At each machine in the second stage, a sequence-independent setup operation is necessary to changeover job types. Once a setup is done for a job type at...