Mathematical formulations for the parallel machine scheduling problem with a single server.

Autor: Elidrissi, Abdelhak, Benmansour, Rachid, Benbrahim, Mohammed, Duvivier, David
Předmět:
Zdroj: International Journal of Production Research; October 2021, Vol. 59 Issue 20, p6166-6184, 19p, 7 Charts
Abstrakt: This paper addresses the problem of scheduling independent jobs on identical parallel machines with a single server to minimise the makespan. We propose mixed integer programming (MIP) formulations to solve this problem. Each formulation reflects a specific concept on how the decision variables are defined. Moreover, we present inequalities that can be used to improve those formulations. A computational study is performed on benchmark instances from the literature to compare the proposed MIP formulations with other known formulations from the literature. It turns out that our proposed time-indexed variables formulation outperforms by far the other formulations. In addition, we propose a very efficient MIP formulation to solve a particular case of the problem with a regular job set. This formulation is able to solve all regular instances for the case of 500 jobs and 5 machines in less than 5.27 min, where all other formulations are not able to produce a feasible solution within 1 h. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index
Externí odkaz:
Nepřihlášeným uživatelům se plný text nezobrazuje