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.90063OpenAlexW2013892022MaRDI QIDQ1870022
Leah Epstein, John Noga, Gerhard J. Woeginger
Publication date: 4 May 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00160-8
Related Items (35)
Two-machine open-shop scheduling with rejection to minimize the makespan ⋮ New results on two-machine flow-shop scheduling with rejection ⋮ New approximation algorithms for machine scheduling with rejection on single and parallel machine ⋮ Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines ⋮ Parallel-machine scheduling with release dates and rejection ⋮ Optimally competitive list batching ⋮ An improved heuristic for parallel machine scheduling with rejection ⋮ Scheduling with partial rejection ⋮ A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection ⋮ On-line scheduling with rejection on identical parallel machines ⋮ Scheduling problems with rejection to minimize the maximum flow time ⋮ Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan ⋮ Scheduling with rejection and non-identical job arrivals ⋮ Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ On-line single machine scheduling with release dates and submodular rejection penalties ⋮ Scheduling on parallel identical machines with job-rejection and position-dependent processing times ⋮ Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost ⋮ The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan ⋮ An Optimal Incremental Algorithm for Minimizing Lateness with Rejection ⋮ On Variants of File Caching ⋮ Order acceptance and scheduling with consideration of service level ⋮ Scheduling linear deteriorating jobs with rejection on a single machine ⋮ TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION ⋮ Single-machine scheduling under the job rejection constraint ⋮ Order acceptance and scheduling with machine availability constraints ⋮ 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 ⋮ Bin packing problems with rejection penalties and their dual problems ⋮ Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ 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 ⋮ Online file caching with rejection penalties ⋮ A Semi-Online Algorithm for Single Machine Scheduling with Rejection
Cites Work
This page was built for publication: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
