Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times

Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times

The problem of scheduling jobs with delivery times on parallel machines is studied, where each job can only be processed on a specific subset of the machines called its processing set. Two distinct processing sets are either nested or disjoint; that is, they do not partially overlap. All jobs are av...

Full description

Bibliographic Details
Main Author: Shuguang Li
Format: Article
Language:English
Published: Hindawi Limited 2016-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2016/3203728
id doaj-62b93f8006924f31a3c70cf1eb76db37
record_format Article
spelling doaj-62b93f8006924f31a3c70cf1eb76db372020-11-25T01:47:53ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472016-01-01201610.1155/2016/32037283203728Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery TimesShuguang Li0Key Laboratory of Intelligent Information Processing in Universities of Shandong (Shandong Institute of Business and Technology), Yantai 264005, ChinaThe problem of scheduling jobs with delivery times on parallel machines is studied, where each job can only be processed on a specific subset of the machines called its processing set. Two distinct processing sets are either nested or disjoint; that is, they do not partially overlap. All jobs are available for processing at time 0. The goal is to minimize the time by which all jobs are delivered, which is equivalent to minimizing the maximum lateness from the optimization viewpoint. A list scheduling approach is analyzed and its approximation ratio of 2 is established. In addition, a polynomial time approximation scheme is derived.http://dx.doi.org/10.1155/2016/3203728
collection DOAJ
language English
format Article
sources DOAJ
author Shuguang Li
spellingShingle Shuguang Li
Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times
Mathematical Problems in Engineering
author_facet Shuguang Li
author_sort Shuguang Li
title Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times
title_short Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times
title_full Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times
title_fullStr Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times
title_full_unstemmed Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times
title_sort parallel machine scheduling with nested processing set restrictions and job delivery times
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2016-01-01
description The problem of scheduling jobs with delivery times on parallel machines is studied, where each job can only be processed on a specific subset of the machines called its processing set. Two distinct processing sets are either nested or disjoint; that is, they do not partially overlap. All jobs are available for processing at time 0. The goal is to minimize the time by which all jobs are delivered, which is equivalent to minimizing the maximum lateness from the optimization viewpoint. A list scheduling approach is analyzed and its approximation ratio of 2 is established. In addition, a polynomial time approximation scheme is derived.
url http://dx.doi.org/10.1155/2016/3203728
work_keys_str_mv AT shuguangli parallelmachineschedulingwithnestedprocessingsetrestrictionsandjobdeliverytimes
_version_ 1725014171255308288

Similar Items