Minimizing the Makespan Approximately on Two Identical Parallel Machines with a Loading--Unloading Server
We study makespan minimisation on two identical parallel machines that share a single server for both loading and unloading. Each job must be loaded, processed without interruption on its assigned machine, and unloaded immediately after processing, with a common positive integer duration for all loading and unloading o...