Some single-machine and flowshop scheduling problems with a non-linear deterioration function
From MaRDI portal
Publication:660909
DOI10.1016/J.CAMWA.2011.07.037zbMath1231.90205OpenAlexW2093815255MaRDI QIDQ660909
Publication date: 5 February 2012
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2011.07.037
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect ⋮ The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times ⋮ Single-machine group scheduling problems with deterioration to minimize the sum of completion times ⋮ Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time ⋮ Single-machine scheduling with accelerating deterioration effects
Cites Work
- The complexity of scheduling starting time dependent tasks with release times
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
- Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect
- Single machine multiple common due dates scheduling with learning effects
- Some single-machine scheduling problems with general effects of learning and deterioration
- 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
- Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
- 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 general job-dependent aging effect and maintenance activities to minimize makespan
- Single machine scheduling with decreasing linear deterioration under precedence constraints
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A concise survey of scheduling with time-dependent processing times
- Single machine scheduling problems with deteriorating jobs
- 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
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Single-machine group scheduling problems with deterioration consideration
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Multi-machine scheduling with deteriorating jobs and scheduled maintenance
- 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
- 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: Some single-machine and flowshop scheduling problems with a non-linear deterioration function
