This paper proposes an application of probabilistic technique, namely Gaussian process regression, for estimating an optimal sequence of the single machine with total weighted tardiness (SMTWT) scheduling problem. In this work, the Gaussian process regression (GPR) model is utilized to predict an optimal sequence of the SMTWT problem, and its solution is improved by using an iterated local sear...

This paper addresses the non-preemptive scheduling problem of scheduling jobs on identical parallel machines to minimize the maximum completion time or makespan. The problem has been proved to be NP-hard in the strong sense. The NP-hardness of the problem motivates us to develop a new methodology to obtain near-optimal solutions. We formulate the problem as an integer programming and then propo...

For a given graph with vertex set that is partitioned into clusters, the generalized traveling salesman problem (GTSP) of finding cost-minimal cycle contains exactly one every cluster. We introduce three new GTSP neighborhoods allow simultaneous permutation sequence clusters and selection vertices from each The some known literature are combined an effective iterated local search (ILS) for GTSP...