Minimizing the makespan for scheduling problems with general deterioration effects
Summary: This paper investigates the scheduling problems with general deterioration models. By the deterioration models, the actual processing time functions of jobs depend not only on the scheduled position in the job sequence but also on the total weighted normal processing times of the jobs already processed. In this paper, the objective is to minimize the makespan. For the single-machine scheduling problems with general deterioration effects, we show that the considered problems are polynomially solvable. For the flow shop scheduling problems with general deterioration effects, we also show that the problems can be optimally solved in polynomial time under the proposed conditions.
- Scheduling problems with general effects of deterioration and learning
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- scientific article; zbMATH DE number 2100940
- A note on scheduling problems with learning effect and deteriorating jobs
- Some single-machine scheduling problems with general effects of learning and deterioration
- A bi-criterion single-machine scheduling problem with learning considerations
- A note on scheduling problems with learning effect and deteriorating jobs
- Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling jobs under simple linear deterioration
- Scheduling jobs with a general learning effect model
- Scheduling jobs with position-dependent processing times
- Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position
- Scheduling with general job-dependent learning curves.
- Scheduling with time dependent processing times: Review and extensions
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- Single machine scheduling with learning effect considerations
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect
- Single-machine scheduling with both deterioration and learning effects
- Single-machine scheduling with learning considerations
- Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- The study of group scheduling problems with general dual-position-based job processing times
- An improved genetic algorithm for single-machine inverse scheduling problem
- Multi-machine scheduling with general position-based deterioration to minimize total load revisited
- Single-machine scheduling with accelerating deterioration effects
- Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
This page was built for publication: Minimizing the makespan for scheduling problems with general deterioration effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460302)
