Minimizing the number of tardy jobs in two-machine settings with common due date

Federico Della Croce (), Christos Koulamas () and Vincent T’kindt ()
Additional contact information
Federico Della Croce: D.A.I., Politecnico di Torino
Christos Koulamas: Florida International University
Vincent T’kindt: Université Francois-Rabelais, CNRS, LI EA 6300, OC ERL CNRS 6305

Journal of Combinatorial Optimization, 2017, vol. 34, issue 1, No 8, 133-140

Abstract: Abstract We consider two-machine scheduling problems with job selection. We analyze first the two-machine open shop problem and provide a best possible linear time algorithm. Then, a best possible linear time algorithm is derived for the job selection problem on two unrelated parallel machines. We also show that an exact approach can be derived for both problems with complexity $$O(p(n) \times \sqrt{2}^n)$$ O ( p ( n ) × 2 n ) , p being a polynomial function of n.

Keywords: Scheduling; Approximation algorithms; Exact exponential approaches (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0054-4 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:34:y:2017:i:1:d:10.1007_s10878-016-0054-4

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

DOI: 10.1007/s10878-016-0054-4

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 ().