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

DOI10.1007/s10878-016-0054-4zbMath1383.90011OpenAlexW2467583760MaRDI QIDQ2410033

Vincent T'kindt, Christos P. Koulamas, Frederico Della Croce

Publication date: 17 October 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0054-4

zbMATH Keywords

schedulingapproximation algorithmsexact exponential approaches

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• On an extension of the Sort \& Search method with application to scheduling theory
• Linear time algorithms for some separable quadratic programming problems
• Bin packing: Maximizing the number of pieces packed
• Scheduling shops to minimize the weighted number of late jobs
• Customer order scheduling to minimize the number of late jobs
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item
• Unnamed Item
• Unnamed Item