lunes, 23 de abril de 2018

Ficha del recurso:

Fuente:

Vínculo original en INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 50 (10):2639-2664; 10.1080/00207543.2011.578163 2012
M'Hallah, R; Al-Khamis, T

Última actualización:

jueves, 28 de junio de 2012

Entrada en el observatorio:

jueves, 28 de junio de 2012

Idioma:

Inglés

Archivado en:


Minimising total weighted earliness and tardiness on parallel machines using a hybrid heuristic

Scheduling jobs with different processing times and distinct known due dates on parallel machines (which may be idle) so as to minimise the total weighted earliness and tardiness is NP-hard. It occurs frequently in industrial settings with a just-in-time production environment. Here, small instances of this problem are tackled via an exact mixed-integer program, whereas larger instances are approximately solved using hybrid algorithms. The computational investigation discerns what makes a difficult instance, and demonstrates the efficiency of the approach.