Scheduling a variable maintenance and linear deteriorating jobs on a single machine

DOI10.1016/J.IPL.2014.08.011MaRDI QIDQ458380zbMATH OpenOpenAlexFDO

Authors Min Ji, Wenchang Luo

Publication date 7 October 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2014.08.011

zbMATH Keywords

computational complexityschedulingmaintenancedeteriorating jobs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Approximation schemes for scheduling a maintenance and linear deteriorating jobs
• A note on single-machine makespan scheduling with deteriorating jobs and scheduled maintenance
• Scheduling a deteriorating maintenance activity on a single machine
• Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
• Single machine scheduling with job-dependent machine deterioration

Cites work

• Approximation scheme for scheduling resumable proportionally deteriorating jobs
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs
• Complexity and approximability of scheduling resumable proportionally deteriorating jobs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling with time dependent processing times
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
• The NP-completeness column: An ongoing guide
• Time-dependent scheduling
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(16)

• Multi-machine scheduling with deteriorating jobs and scheduled maintenance
• Single-machine scheduling with job-dependent machine deterioration
• A note on single-machine makespan scheduling with deteriorating jobs and scheduled maintenance
• Scheduling a deteriorating maintenance activity on a single machine
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs
• Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
• An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs
• Approximation algorithms for scheduling with a variable machine maintenance
• A binary multiple knapsack model for single machine scheduling with machine unavailability
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
• Scheduling jobs under increasing linear machine maintenance time
• scientific article; zbMATH DE number 6531643 (Why is no real title available?)
• Single machine scheduling with job-dependent machine deterioration
• Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time

This page was built for publication: Scheduling a variable maintenance and linear deteriorating jobs on a single machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458380)