SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS

DOI10.1142/S0217595912500194zbMath1250.90035MaRDI QIDQ2920364

Baoqiang Fan, Shi-Sheng Li

Publication date: 16 October 2012

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

schedulingdeteriorating jobsFPTASavailability constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Parallel-machine scheduling with time-dependent and machine availability constraints ⋮ Parallel machines scheduling with deteriorating jobs and availability constraints ⋮ Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration ⋮ Some Scheduling Problems on a Single Machine with General Job Effects of Position-Dependent Learning and Start-Time-Dependent Deterioration ⋮ Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval

Cites Work

• Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
• Preemptive scheduling with simple linear deterioration on a single machine
• Parallel-machine scheduling with deteriorating jobs and rejection
• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Time-dependent scheduling
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• Scheduling jobs under simple linear deterioration
• A concise survey of scheduling with time-dependent processing times
• Parallel machine scheduling with time dependent processing times
• Complexity and approximability of scheduling resumable proportionally deteriorating jobs
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• The NP-completeness column: An ongoing guide

This page was built for publication: SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS