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

Lisi Cao, Jianhong Hao and Dakui Jiang

Complexity, 2020, vol. 2020, 1-6

Abstract:

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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/1647401.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/1647401.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:1647401

DOI: 10.1155/2020/1647401

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().