Scheduling linear deteriorating jobs with rejection on a single machine

From MaRDI portal
Publication:953419

DOI10.1016/j.ejor.2007.11.047zbMath1179.90132OpenAlexW2059434334MaRDI QIDQ953419

Yushao Cheng, Shijie Sun

Publication date: 20 November 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.11.047




Related Items

Scheduling with release times and rejection on two parallel machinesNew approximation algorithms for machine scheduling with rejection on single and parallel machineSCHEDULING DETERIORATING JOBS ON A SINGLE MACHINE WITH RELEASE TIMES AND REJECTIONParallel-machine scheduling with release dates and rejectionDue date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobsAn improved heuristic for parallel machine scheduling with rejectionA tardiness-augmented approximation scheme for rejection-allowed multiprocessor reschedulingSingle machine problem with multi-rate-modifying activities under a time-dependent deteriorationApproximation algorithms for parallel machine scheduling with linear deteriorationA survey on offline scheduling with rejectionOnline scheduling with deterioration and unexpected processor breakdownSingle-machine scheduling of proportional-linearly deteriorating jobs with positional due indicesPenalty cost constrained identical parallel machine scheduling problemParallel-batch scheduling with deterioration and rejection on a single machineApproximation algorithms for precedence-constrained identical machine scheduling with rejectionAn FPTAS for uniform machine scheduling to minimize makespan with linear deteriorationA bicriteria approach to scheduling a single machine with job rejection and positional penaltiesOptimal algorithms for online single machine scheduling with deteriorating jobsSingle-machine scheduling and due date assignment with rejection and position-dependent processing timesScheduling 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 costMulti-machine scheduling with interval constrained position-dependent processing timesScheduling simple linear deteriorating jobs with rejectionScheduling a bounded parallel-batching machine with incompatible job families and rejectionNon-permutation flow shop scheduling with order acceptance and weighted tardinessOrder acceptance and scheduling with consideration of service levelBatch scheduling with proportional-linear deterioration and outsourcingTWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTIONScheduling with job-rejection and position-dependent processing times on proportionate flowshopsSingle-machine scheduling under the job rejection constraintOrder acceptance and scheduling with machine availability constraintsTwo-machine flow-shop scheduling with rejectionParallel-batch scheduling of deteriorating jobs with release dates to minimize the makespanAn efficient optimal solution to the coil sequencing problem in electro-galvanizing lineParallel-machine scheduling with deteriorating jobs and rejectionMinimizing the makespan on a single parallel batching machineMinmax scheduling and due-window assignment with position-dependent processing times and job rejectionApplying ``peeling onion approach for competitive analysis in online scheduling with rejectionBounded single-machine parallel-batch scheduling with release dates and rejectionA review of four decades of time-dependent scheduling: main results, new topics, and open problemsA note on the optimal sequence position for a rate-modifying activity under simple linear deteriorationSingle machine scheduling with release dates and rejectionParallel-machine scheduling with job-dependent cumulative deterioration effect and rejectionTwo-agent scheduling with rejection on a single machineA classification of dynamic programming formulations for offline deterministic single-machine scheduling problems



Cites Work