On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
From MaRDI portal
Publication:1870022
DOI10.1016/S0167-6377(02)00160-8zbMath1013.90063MaRDI QIDQ1870022
Gerhard J. Woeginger, Leah Epstein, John Noga
Publication date: 4 May 2003
Published in: Operations Research Letters (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
Related Items
TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION, Permutation flow shop scheduling with order acceptance and weighted tardiness, Scheduling on parallel identical machines with job-rejection and position-dependent processing times, Parallel-machine scheduling with deteriorating jobs and rejection, Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment, Optimally competitive list batching, On-line scheduling with rejection on identical parallel machines, The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan, Scheduling linear deteriorating jobs with rejection on a single machine, Single-machine scheduling under the job rejection constraint, Bounded single-machine parallel-batch scheduling with release dates and rejection, A PTAS for parallel batch scheduling with rejection and dynamic job arrivals, On-line scheduling of unit time jobs with rejection on uniform machines, Single machine scheduling with release dates and rejection, Scheduling with rejection and non-identical job arrivals, Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost, Bin packing problems with rejection penalties and their dual problems, On Variants of File Caching, An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
Cites Work
