Single-machine scheduling with deteriorating jobs
From MaRDI portal
Publication:4909259
DOI10.1080/00207721003802263zbMath1259.90036OpenAlexW2082773846MaRDI QIDQ4909259
Publication date: 12 March 2013
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721003802263
Related Items (4)
An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ New machine-learning algorithms for prediction of Parkinson's disease ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations
Cites Work
- Scheduling jobs with varying processing times
- Parallel-machine scheduling of simple linear deteriorating jobs
- Single-machine and two-machine flowshop scheduling with general learning functions
- Flow shop scheduling with effects of learning and deterioration
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
- On a scheduling problem of time deteriorating jobs
- Scheduling jobs under simple linear deterioration
- 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 with deadlines and increasing rates of processing times
- Minimizing the total weighted completion time of deteriorating jobs
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling deteriorating jobs to minimize makespan
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- A note on scheduling problems with learning effect and deteriorating jobs
- Minimizing maximum lateness under linear deterioration
- Single machine scheduling with step-deteriorating processing times
This page was built for publication: Single-machine scheduling with deteriorating jobs
