Tabu search and particle swarm optimization algorithms for two identical parallel machines scheduling problem with a single server

This paper proposes two efficient algorithms, which are tabu search and particle swarm optimization, for scheduling two identical parallel machines with a single server. The server has to set up the relevant machine before starting job processing. The objective is to minimize the makespan. This prob...

Popoln opis

Bibliografske podrobnosti

Principais autores:	Ibrahim Alharkan, Mustafa Saleh, Mageed A. Ghaleb, Husam Kaid, Abdulsalam Farhan, A. Almarfadi
Format:	Artigo
Jezik:	Inglês
Izdano:	Springer 2020-07-01
Serija:	Journal of King Saud University: Engineering Sciences
Teme:	Scheduling Identical parallel machines Single server Tabu search PSO
Online dostop:	http://www.sciencedirect.com/science/article/pii/S1018363918309218
Oznake:	Označite Brez oznak, prvi označite!