Single machine scheduling with decreasing linear deterioration under precedence constraints

DOI10.1016/j.camwa.2009.03.108zbMath1189.90069OpenAlexW2022548160MaRDI QIDQ980093

J. Martínez

Publication date: 28 June 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2009.03.108

zbMATH Keywords

schedulingdeteriorating jobssingle machinemakespanseries-parallel graphparallel chains

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times ⋮ Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints ⋮ Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning ⋮ Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties ⋮ Single-machine group scheduling problems with deterioration to minimize the sum of completion times ⋮ Single-machine scheduling with upper bounded maintenance time under the deteriorating effect ⋮ A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models ⋮ Some single-machine and flowshop scheduling problems with a non-linear deterioration function ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Single-machine scheduling problems with precedence constraints and simple linear deterioration

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of scheduling starting time dependent tasks with release times
• Scheduling jobs under decreasing linear deterioration
• Scheduling jobs under simple linear deterioration
• Complexity of scheduling tasks with time-dependent execution times
• Complexity analysis of job-shop scheduling with deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• Minimizing the total weighted completion time of deteriorating jobs
• Parallel machine scheduling with time dependent processing times
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Multi-Machine Scheduling With Linear Deterioration
• Minimizing maximum lateness under linear deterioration

This page was built for publication: Single machine scheduling with decreasing linear deterioration under precedence constraints