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

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

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 para...

Full description

Bibliographic Details
Main Authors: Lisi Cao, Jianhong Hao, Dakui Jiang
Format: Article
Language:English
Published: Hindawi-Wiley 2020-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2020/1647401
id doaj-242943b364ed44beb80ae9e79e5bd28b
record_format Article
spelling doaj-242943b364ed44beb80ae9e79e5bd28b2020-11-24T23:49:23ZengHindawi-WileyComplexity1076-27871099-05262020-01-01202010.1155/2020/16474011647401Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize MakespanLisi Cao0Jianhong Hao1Dakui Jiang2School of International Business, Tianjin Foreign Studies University, Tianjin 300270, ChinaCollege of Management and Economics, Tianjin University, Tianjin 300072, ChinaDepartment of Operation Management, Sea Tide Investments Ltd., Port Perry, Ontario L9L1B5, CanadaA 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.http://dx.doi.org/10.1155/2020/1647401
collection DOAJ
language English
format Article
sources DOAJ
author Lisi Cao
Jianhong Hao
Dakui Jiang
spellingShingle Lisi Cao
Jianhong Hao
Dakui Jiang
Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan
Complexity
author_facet Lisi Cao
Jianhong Hao
Dakui Jiang
author_sort Lisi Cao
title Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan
title_short Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan
title_full Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan
title_fullStr Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan
title_full_unstemmed Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan
title_sort two parallel machines scheduling with two-vehicle job delivery to minimize makespan
publisher Hindawi-Wiley
series Complexity
issn 1076-2787
1099-0526
publishDate 2020-01-01
description 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.
url http://dx.doi.org/10.1155/2020/1647401
work_keys_str_mv AT lisicao twoparallelmachinesschedulingwithtwovehiclejobdeliverytominimizemakespan
AT jianhonghao twoparallelmachinesschedulingwithtwovehiclejobdeliverytominimizemakespan
AT dakuijiang twoparallelmachinesschedulingwithtwovehiclejobdeliverytominimizemakespan
_version_ 1716266834704990208

Similar Items