Approximation algorithms for precedence-constrained identical machine scheduling with rejection

Xianzhao Zhang, Dachuan Xu (), Donglei Du and Chenchen Wu
Additional contact information
Xianzhao Zhang: Linyi University
Dachuan Xu: Beijing University of Technology
Donglei Du: University of New Brunswick
Chenchen Wu: Tianjin University of Technology

Journal of Combinatorial Optimization, 2018, vol. 35, issue 1, No 22, 318-330

Abstract: Abstract We study a precedence-constrained identical parallel machine scheduling problem with rejection. There is a communication delay between any two jobs connected in the precedence network where jobs may be rejected with penalty. The goal is to minimize the sum of the makespan and the rejection cost. We propose two 3-approximation algorithms for this problem under linear and submodular rejection costs respectively. These two algorithms are both based on linear programming rounding technique.

Keywords: Scheduling; Rejection; Approximation algorithm; Linear programming; Rounding (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0044-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:35:y:2018:i:1:d:10.1007_s10878-016-0044-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0044-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().