MIP Models and Hybrid Algorithms for Simultaneous Job Splitting and Scheduling on Unrelated Parallel Machines

Abstract EN

We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property.

The first contribution of this paper is to introduce novel algorithms which make splitting and scheduling simultaneously with variable number of subjobs.

We proposed simple chromosome structure which is constituted by random key numbers in hybrid genetic-local search algorithm (GAspLA).

Random key numbers are used frequently in genetic algorithms, but it creates additional difficulty when hybrid factors in local search are implemented.

We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes’ random key numbers.

This is the second contribution of the paper.

The third contribution of this paper is three developed new MIP models which are making splitting and scheduling simultaneously.

The fourth contribution of this paper is implementation of the GAspLAMIP.

This implementation let us verify the optimality of GAspLA for the studied combinations.

The proposed methods are tested on a set of problems taken from the literature and the results validate the effectiveness of the proposed algorithms.