Multiprocessor Scheduling with Rejection

From MaRDI portal
Publication:4943705

DOI10.1137/S0895480196300522zbMath0936.68012OpenAlexW2012228660MaRDI QIDQ4943705

Jiří Sgall, Leen Stougie, Alberto Marchetti-Spaccamela, Stefano Leonardi, Yair Bartal

Publication date: 19 March 2000

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480196300522




Related Items (only showing first 100 items - show all)

Vector scheduling with rejection on two machinesScheduling with release times and rejection on two parallel machinesTwo-machine open-shop scheduling with rejection to minimize the makespanNew results on two-machine flow-shop scheduling with rejectionIn-house production and outsourcing under different discount schemes on the total outsourcing costNew approximation algorithms for machine scheduling with rejection on single and parallel machineMinimizing maximum delivery completion time for order scheduling with rejectionOnline scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machinesSCHEDULING DETERIORATING JOBS ON A SINGLE MACHINE WITH RELEASE TIMES AND REJECTIONParallel-machine scheduling with release dates and rejectionAn improved heuristic for parallel machine scheduling with rejectionBin packing with rejection revisitedMin-max regret version of a scheduling problem with outsourcing decisions under processing time uncertaintySingle machine scheduling with rejection and generalized parametersScheduling with machine cost and rejectionSingle machine scheduling with rejection to minimize the weighted makespanLocal Search Algorithms for k-Median and k-Facility Location Problems with Linear PenaltiesParallel machine scheduling with restricted job rejectionSingle Machine Scheduling with an Availability Constraint and RejectionApproximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penaltiesOUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMESScheduling with partial rejectionA semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejectionRejecting jobs to minimize load and maximum flow-timeTwo-agent parallel-machine scheduling with rejectionSingle-machine scheduling with production and rejection costs to minimize the maximum earlinessOnline scheduling to minimize the total weighted completion time plus the rejection costOn-line scheduling with rejection on identical parallel machinesSemi-online scheduling on two identical machines with rejectionOn the mass COVID-19 vaccination scheduling problemAn \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machinesParallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machineCoordinated scheduling of the outsourcing, in-house production and distribution operationsA unified framework for designing EPTAS for load balancing on parallel machinesBicriteria order acceptance and scheduling with consideration of fill rateA survey on offline scheduling with rejectionAlgorithms for single machine scheduling problem with release dates and submodular penaltiesPreemptive online scheduling with rejection of unit jobs on two uniformly related machinesExact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penaltiesParallel Machines Scheduling with Deteriorating Maintenance Activities and Job RejectionScheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection costFixed interval scheduling with third‐party machinesScheduling problems with rejection to minimize the maximum flow timeOptimal semi-online algorithm for scheduling with rejection on two uniform machinesPenalty cost constrained identical parallel machine scheduling problemParallel-batch scheduling with deterioration and rejection on a single machineScheduling with rejection and non-identical job arrivalsTwo-machine flow shop scheduling problem with an outsourcing optionApproximation algorithms for precedence-constrained identical machine scheduling with rejectionOnline scheduling of unit jobs on three machines with rejection: a tight resultScheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machinesSingle-machine scheduling and due date assignment with rejection and position-dependent processing timesApproximation algorithms for supply chain planning and logistics problems with market choiceScheduling 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 rejectionOnline scheduling with rejection and withdrawalSingle-machine scheduling with maintenance activities and rejectionThe unbounded parallel batch machine scheduling with release dates and rejection to minimize makespanAn Optimal Incremental Algorithm for Minimizing Lateness with RejectionExact methods for order acceptance and scheduling on unrelated parallel machinesScheduling a bounded parallel-batching machine with incompatible job families and rejectionOnline scheduling with rejection and reordering: exact algorithms for unit size jobsNon-Preemptive Flow-Time Minimization via RejectionsOnline scheduling with machine cost and rejectionVector scheduling with rejection on a single machineOn Variants of File CachingImproved approximation algorithms for parallel machine scheduling with release dates and job rejectionOrder acceptance and scheduling with consideration of service levelOnline unit clustering: Variations on a themeBatch scheduling with proportional-linear deterioration and outsourcingTWO-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 setupsMinimizing the makespan on a single parallel batching machineBin packing problems with rejection penalties and their dual problemsApplying ``peeling onion approach for competitive analysis in online scheduling with rejectionAn approximation algorithm for \(k\)-facility location problem with linear penalties using local search schemePreemptive multiprocessor scheduling with rejectionApproximation algorithms for the multiprocessor scheduling with submodular penaltiesSingle Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount RatesBounded single-machine parallel-batch scheduling with release dates and rejectionOnline scheduling in a parallel batch processing system to minimize makespan using restartsScheduling with Rejection and a Deteriorating Maintenance Activity on a Single MachineA PTAS for parallel batch scheduling with rejection and dynamic job arrivalsOn-line scheduling of unit time jobs with rejection on uniform machinesSingle machine scheduling with release dates and rejectionMulticriteria schedulingTwo-agent scheduling with rejection on a single machineThe online \(k\)-server problem with rejectionRent or buy problems with a fixed time horizonOnline file caching with rejection penaltiesDue-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional EffectsA manifesto for the computational methodA Semi-Online Algorithm for Single Machine Scheduling with RejectionOn-line scheduling of unit time jobs with rejection: Minimizing the total completion timePreemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machinesMachine scheduling with job rejection and Dejong's learning effect




This page was built for publication: Multiprocessor Scheduling with Rejection