A single-machine scheduling with a truncated linear deterioration and ready times

DOI10.1016/j.ins.2013.08.030zbMath1321.90060OpenAlexW2033161932MaRDI QIDQ497952

Wen-Hsiang Wu, Peng-Hsiang Hsu, Wen-Hung Wu, Jianyou Xu, Chin-Chia Wu, Yunqiang Yin

Publication date: 25 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.08.030

zbMATH Keywords

schedulingtabu searchsingle-machinedeteriorating jobant colony

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (15)

Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration ⋮ Scheduling jobs with general truncated learning effects including proportional setup times ⋮ Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs ⋮ Patients scheduling problems with deferred deteriorated functions ⋮ Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects ⋮ 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 ⋮ Optimization of scheduling problems with deterioration effects and an optional maintenance activity ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ Online scheduling with linear deteriorating jobs to minimize the total weighted completion time ⋮ Research on scheduling problems with general effects of deterioration and learning ⋮ Parallel machines scheduling with deteriorating jobs and availability constraints ⋮ Single machine group scheduling with time dependent processing times and ready times ⋮ Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect ⋮ Some Scheduling Problems on a Single Machine with General Job Effects of Position-Dependent Learning and Start-Time-Dependent Deterioration

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of scheduling starting time dependent tasks with release times
• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs
• Time-dependent scheduling
• 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
• A note on single-processor scheduling with time-dependent execution times
• Single machine group scheduling under decreasing linear deterioration
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
• 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
• Tabu Search—Part I
• Single machine sequencing with linear models of release dates
• Scheduling jobs with piecewise linear decreasing processing times
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Single machine scheduling with step-deteriorating processing times

This page was built for publication: A single-machine scheduling with a truncated linear deterioration and ready times