Single-machine scheduling with deteriorating functions for job processing times

DOI10.1016/j.apm.2010.04.014zbMath1201.90073OpenAlexW2027520807MaRDI QIDQ611703

Sumit K. Garg

Publication date: 14 December 2010

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2010.04.014

zbMATH Keywords

schedulingdeteriorating jobssingle machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (14)

Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ Algorithms for single-machine scheduling problem with deterioration depending on a novel model ⋮ Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance ⋮ Single-machine scheduling problems with an actual time-dependent deterioration ⋮ Parallel machine scheduling with general sum of processing time based models ⋮ Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity ⋮ The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect ⋮ Considerations of single-machine scheduling with deteriorating jobs ⋮ Online scheduling with linear deteriorating jobs to minimize the total weighted completion time ⋮ Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties ⋮ Scheduling problems with position dependent job processing times: computational complexity results ⋮ Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates ⋮ The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard

Cites Work

• Unnamed Item
• The complexity of scheduling starting time dependent tasks with release times
• Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
• Single-machine scheduling problems with both deteriorating jobs and learning effects
• A single-machine scheduling problem with two-agent and deteriorating jobs
• Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
• Time-dependent scheduling
• Learning effect and deteriorating jobs in the single machine scheduling problems
• A due-date assignment problem with learning effect and deteriorating jobs
• Single machine scheduling with start time dependent processing times: Some solvable cases
• A concise survey of scheduling with time-dependent processing times
• Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
• Complexity and approximability of scheduling resumable proportionally deteriorating jobs
• Single machine group scheduling under decreasing linear deterioration
• 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
• Scheduling jobs with piecewise linear decreasing processing times
• Single machine scheduling with step-deteriorating processing times

This page was built for publication: Single-machine scheduling with deteriorating functions for job processing times