Preemptive scheduling with rejection

From MaRDI portal
Publication:1411622

DOI10.1007/s10107-002-0324-zzbMath1030.90025OpenAlexW1988943741MaRDI QIDQ1411622

Martin Skutella, Gerhard J. Woeginger, Hoogeveen, J. A.

Publication date: 29 October 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15560



Related Items

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, Parallel-machine scheduling with release dates and rejection, An improved heuristic for parallel machine scheduling with rejection, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Scheduling with machine cost and rejection, Single machine scheduling with rejection to minimize the weighted makespan, Single Machine Scheduling with an Availability Constraint and Rejection, Scheduling with partial rejection, Two-agent parallel-machine scheduling with rejection, Single-machine scheduling with production and rejection costs to minimize the maximum earliness, Semi-online scheduling on two identical machines with rejection, A survey on offline scheduling with rejection, Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost, Scheduling and fixed-parameter tractability, Scheduling problems with rejection to minimize the maximum flow time, Optimal semi-online algorithm for scheduling with rejection on two uniform machines, Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan, Penalty cost constrained identical parallel machine scheduling problem, Proportionate Flow Shop Scheduling with Rejection, Approximation algorithms for precedence-constrained identical machine scheduling with rejection, Order acceptance and scheduling with delivery under generalized parameters, Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines, A bicriteria approach to scheduling a single machine with job rejection and positional 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, Scheduling simple linear deteriorating jobs with rejection, The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan, An Optimal Incremental Algorithm for Minimizing Lateness with Rejection, Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration, Scheduling a bounded parallel-batching machine with incompatible job families and rejection, Four decades of research on the open-shop scheduling problem to minimize the makespan, Order acceptance and scheduling with consideration of service level, TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION, Single-machine scheduling under the job rejection constraint, A fast asymptotic approximation scheme for bin packing with rejection, Order acceptance and scheduling with machine availability constraints, On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups, Parallel-machine scheduling with deteriorating jobs and rejection, Minimizing the makespan on a single parallel batching machine, Multipurpose machine scheduling with rejection and identical job processing times, Bounded single-machine parallel-batch scheduling with release dates and rejection, Scheduling deteriorating jobs with rejection on dominant machines, A PTAS for parallel batch scheduling with rejection and dynamic job arrivals, Single machine scheduling with release dates and rejection, Multicriteria scheduling, In memoriam: Gerhard Woeginger (1964--2022), Two-agent scheduling with rejection on a single machine, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines