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...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2020-07-01
|
| Series: | Journal of King Saud University: Engineering Sciences |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1018363918309218 |