Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties

DOI10.1007/978-3-319-13075-0_51zbMATH Open1432.90053OpenAlexW580528249MaRDI QIDQ2942667

C. Gregory Plaxton, Nevzat Onur Domaniç

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13075-0_51

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Scheduling for weighted flow time and energy with rejection penalty ⋮ Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines

This page was built for publication: Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties