Approximation schemes for scheduling a maintenance and linear deteriorating jobs
From MaRDI portal
Publication:2358862
DOI10.3934/jimo.2012.8.271zbMath1364.90161OpenAlexW2328908167MaRDI QIDQ2358862
Publication date: 16 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2012.8.271
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents, An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs, Single-machine scheduling and due date assignment with rejection and position-dependent processing times, Scheduling a variable maintenance and linear deteriorating jobs on a single machine, Control augmentation design of UAVs based on deviation modification of aerodynamic focus, Two-machine scheduling with periodic availability constraints to minimize makespan, A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Cites Work
- Unnamed Item
- Single-machine scheduling with periodic maintenance to minimize makespan
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Supply chain partnership for three-echelon deteriorating inventory model
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
- Fast approximation algorithm for job sequencing with deadlines
- Machine scheduling with availability constraints
- Scheduling jobs under simple linear deterioration
- A concise survey of 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
- Machine scheduling with an availability constraint
- Scheduling Deteriorating Jobs on a Single Processor
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- 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)?
