A single-machine scheduling with a truncated linear deterioration and ready times
From MaRDI portal
Publication:497952
DOI10.1016/J.INS.2013.08.030zbMATH Open1321.90060OpenAlexW2033161932MaRDI QIDQ497952FDOQ497952
Authors: Chin-Chia Wu, Wen-Hsiang Wu, Wen-Hung Wu, Peng-Hsiang Hsu, Yunqiang Yin, Jianyou Xu 
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
Recommendations
- Single-machine ready times scheduling with group technology and proportional linear deterioration
- Scheduling problems with effects of deterioration and truncated job-dependent learning
- scientific article; zbMATH DE number 5732213
- scientific article; zbMATH DE number 1594552
- Single machine scheduling problems with deteriorating jobs
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Ant colony optimization.
- Tabu Search—Part I
- Time-dependent scheduling
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- The complexity of scheduling starting time dependent tasks with release times
- Scheduling Deteriorating Jobs on a Single Processor
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A concise survey of scheduling with time-dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- Single machine scheduling with step-deteriorating processing times
- A note on single-processor scheduling with time-dependent execution times
- Title not available (Why is that?)
- Single machine sequencing with linear models of release dates
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling start time dependent jobs to minimize the total weighted completion time
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- Single machine group scheduling under decreasing linear deterioration
- Scheduling jobs with piecewise linear decreasing processing times
Cited In (21)
- A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function
- Supply chain scheduling with deteriorating jobs and delivery times
- Title not available (Why is that?)
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration
- Some scheduling problems on a single machine with general job effects of position-dependent learning and start-time-dependent deterioration
- Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect
- Research on scheduling problems with general effects of deterioration and learning
- Single machine group scheduling with time dependent processing times and ready times
- Parallel machines scheduling with deteriorating jobs and availability constraints
- Patients scheduling problems with deferred deteriorated functions
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
- Optimization of scheduling problems with deterioration effects and an optional maintenance activity
- Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times
- Scheduling jobs with general truncated learning effects including proportional setup times
- Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
- Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect
- Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration
- Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
This page was built for publication: A single-machine scheduling with a truncated linear deterioration and ready times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497952)
