Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs

Hui-Chih Hung (), Bertrand M. T. Lin (), Marc E. Posner () and Jun-Min Wei ()
Additional contact information
Hui-Chih Hung: National Chiao Tung University
Bertrand M. T. Lin: National Chiao Tung University
Marc E. Posner: The Ohio State University
Jun-Min Wei: National Chiao Tung University

Journal of Scheduling, 2019, vol. 22, issue 4, No 3, 413-431

Abstract: Abstract This paper investigates the classical preemptive parallel-machine scheduling problem of maximizing number of on-time jobs. While the problem is known to be NP-hard, no theoretical analysis of approximation algorithms exists in the literature. As part of the analysis, a new non-standard mixed integer formulation is developed. We propose heuristics based on different design strategies. These heuristics have asymptotically tight relative errors of 1/2. Experimental tests evaluate the computational performance of the procedures.

Keywords: Parallel-machine scheduling; Number of tardy jobs; Preemption; Mixed integer program; Heuristic performance analysis (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-018-0584-y 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:jsched:v:22:y:2019:i:4:d:10.1007_s10951-018-0584-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-018-0584-y

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

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