Preemptive scheduling with rejection

From MaRDI portal
Revision as of 16:44, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1411622

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

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 (51)

Two-machine open-shop scheduling with rejection to minimize the makespanNew results on two-machine flow-shop scheduling with rejectionNew approximation algorithms for machine scheduling with rejection on single and parallel machineParallel-machine scheduling with release dates and rejectionAn improved heuristic for parallel machine scheduling with rejectionComplexity and approximation of open shop scheduling to minimize the makespan: a review of models and approachesScheduling with machine cost and rejectionSingle machine scheduling with rejection to minimize the weighted makespanSingle Machine Scheduling with an Availability Constraint and RejectionScheduling with partial rejectionTwo-agent parallel-machine scheduling with rejectionSingle-machine scheduling with production and rejection costs to minimize the maximum earlinessSemi-online scheduling on two identical machines with rejectionA survey on offline scheduling with rejectionScheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection costScheduling and fixed-parameter tractabilityScheduling problems with rejection to minimize the maximum flow timeOptimal semi-online algorithm for scheduling with rejection on two uniform machinesSingle machine scheduling with rejection to minimize the \(k\)-th power of the makespanPenalty cost constrained identical parallel machine scheduling problemProportionate Flow Shop Scheduling with RejectionApproximation algorithms for precedence-constrained identical machine scheduling with rejectionOrder acceptance and scheduling with delivery under generalized parametersScheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machinesA bicriteria approach to scheduling a single machine with job rejection and positional penaltiesScheduling on parallel identical machines with job-rejection and position-dependent processing timesOnline scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection costScheduling simple linear deteriorating jobs with rejectionThe unbounded parallel batch machine scheduling with release dates and rejection to minimize makespanAn Optimal Incremental Algorithm for Minimizing Lateness with RejectionMixed integer programming model for scheduling in unrelated parallel processor system with priority considerationScheduling a bounded parallel-batching machine with incompatible job families and rejectionFour decades of research on the open-shop scheduling problem to minimize the makespanOrder acceptance and scheduling with consideration of service levelTWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTIONSingle-machine scheduling under the job rejection constraintA fast asymptotic approximation scheme for bin packing with rejectionOrder acceptance and scheduling with machine availability constraintsOn maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setupsParallel-machine scheduling with deteriorating jobs and rejectionMinimizing the makespan on a single parallel batching machineMultipurpose machine scheduling with rejection and identical job processing timesBounded single-machine parallel-batch scheduling with release dates and rejectionScheduling deteriorating jobs with rejection on dominant machinesA PTAS for parallel batch scheduling with rejection and dynamic job arrivalsSingle machine scheduling with release dates and rejectionMulticriteria schedulingIn memoriam: Gerhard Woeginger (1964--2022)Two-agent scheduling with rejection on a single machineA classification of dynamic programming formulations for offline deterministic single-machine scheduling problemsPreemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines






This page was built for publication: Preemptive scheduling with rejection