Parallel dedicated machine scheduling with conflict graphs

•Scheduling with conflicts subject to fixed job sequences is introduced.•Complexity status is investigated.•Dynamic programming algorithms are developed. This paper investigates a variant of parallel-machine scheduling problems with conflict constraints. A set of identical parallel machines is avail...

Full description

Saved in:
Bibliographic Details
Published in:Computers & industrial engineering Vol. 124; pp. 316 - 321
Main Authors: Hong, Huai-Che, Lin, Bertrand M.T.
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.10.2018
Subjects:
Conflict graph
Dynamic programming
Fixed sequences
NP-hardness
Parallel dedicated machines
Conflict graph
NP-hardness
Parallel dedicated machines
Dynamic programming
Fixed sequences
ISSN:0360-8352, 1879-0550
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•Scheduling with conflicts subject to fixed job sequences is introduced.•Complexity status is investigated.•Dynamic programming algorithms are developed. This paper investigates a variant of parallel-machine scheduling problems with conflict constraints. A set of identical parallel machines is available for processing a set of jobs subject to conflict constraints, which specify pairs of jobs that are mutually disjoint due to resource availability. Jobs conflicting to each other cannot be processed simultaneously. The scheduling problem is to construct a feasible schedule that optimizes the considered managerial performance measures. This paper discusses the specific two-machine setting where each machine has a designated set of jobs to process. We give NP-hardness proofs for the case with the presence of a fixed processing sequence on one of the machines. Polynomial-time dynamic programming algorithms are proposed to produce optimal schedules for the case where the processing sequences on both machines are known and fixed a priori.
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2018.07.035