Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan

Abstract EN

A problem of parallel machine scheduling with coordinated job deliveries is handled to minimize the makespan.

Different jobs call for dissimilar sizes of storing space in the process of transportation.

A range of jobs of one customer in the problem have priority to be processed on two identical parallel machines without preemption and then delivered to the customer by two vehicles in batches.

For this NP-hard problem, we first prove that it is impossible to have a polynomial heuristic with a worst-case performance ratio bound less than 2 unless P = NP.

Thereafter, we develop a polynomial heuristic for this problem, the worst-case ratio of which is bounded by 2.