Parallel-machine scheduling with deteriorating jobs and rejection

DOI10.1016/j.tcs.2010.06.008zbMath1207.68111OpenAlexW1987063401MaRDI QIDQ708217

Jinjiang Yuan, Shi-Sheng Li

Publication date: 11 October 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.008

zbMATH Keywords

schedulingdeteriorating jobsrejectionfully polynomial-time approximation scheme

Mathematics Subject Classification ID

Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Patient scheduling with deteriorating treatment duration and maintenance activity ⋮ SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS ⋮ Two-agent parallel-machine scheduling with rejection ⋮ A survey on offline scheduling with rejection ⋮ Graph multi-coloring for a job scheduling application ⋮ Approximation algorithms for precedence-constrained identical machine scheduling with rejection ⋮ Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions ⋮ Identical parallel machine scheduling with time-dependent processing times ⋮ Single-machine scheduling and due date assignment with rejection and position-dependent processing times ⋮ Scheduling on parallel identical machines with job-rejection and position-dependent processing times ⋮ Scheduling simple linear deteriorating jobs with rejection ⋮ Scheduling a bounded parallel-batching machine with incompatible job families and rejection ⋮ TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION ⋮ An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs ⋮ Multipurpose machine scheduling with rejection and identical job processing times ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection ⋮ Two-agent scheduling with rejection on a single machine ⋮ Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval ⋮ A Semi-Online Algorithm for Single Machine Scheduling with Rejection

Cites Work

• Unnamed Item
• Unnamed Item
• Time-dependent scheduling
• Scheduling linear deteriorating jobs with rejection on a single machine
• Single machine scheduling with release dates and rejection
• Scheduling jobs under simple linear deterioration
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• Preemptive scheduling with rejection
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Parallel machine scheduling with time dependent processing times
• Scheduling with machine cost and rejection
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Parallel-machine scheduling with time dependent processing times
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Techniques for scheduling with rejection
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
• Multi-Machine Scheduling With Linear Deterioration
• Preemptive multiprocessor scheduling with rejection

This page was built for publication: Parallel-machine scheduling with deteriorating jobs and rejection