Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times

DOI10.1016/j.cor.2006.10.010zbMath1139.90012OpenAlexW2009773368MaRDI QIDQ2462556

Daniel Oron

Publication date: 30 November 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.10.010

zbMATH Keywords

growth ratesschedulingdeteriorating jobssingle machineTADC

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (17)

Scheduling deteriorating jobs with a learning effect on unrelated parallel machines ⋮ Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance ⋮ Minimizing total load on parallel machines with linear deterioration ⋮ Total absolute deviation of job completion times on uniform and unrelated machines ⋮ Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect ⋮ Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect ⋮ Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times ⋮ Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning ⋮ A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection ⋮ Single-machine scheduling with nonlinear deterioration ⋮ Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties ⋮ Single-machine makespan minimization scheduling with nonlinear shortening processing times ⋮ Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling jobs under decreasing linear deterioration
• Optimal common due-date with limited completion time deviation
• Scheduling jobs under simple linear deterioration
• A concise survey of scheduling with time-dependent processing times
• Scheduling Deteriorating Jobs on a Single Processor
• Minimizing Variation of Flow Time in Single Machine Systems
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Due-date assignment and single machine scheduling with deteriorating jobs
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Variance Minimization in Single Machine Sequencing Problems

This page was built for publication: Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times