Single-machine scheduling problems with a sum-of-processing-time-based learning function
Summary: Recently, learning scheduling problems have received increasing attention. However, the majority of the research assume that the actual job processing time is a function of its position. This paper deals with the single-machine scheduling problem with a sum-of-processing-time-based learning effect. By the effect of sum-of-processing-time-based learning, we mean that the processing time of a job is defined by total normal processing time of jobs in front of it in the sequence. We show that the single-machine makespan problem remains polynomially solvable under the proposed model. We show that the total completion time minimization problem for \(a\geq 1\) remains polynomially solvable under the proposed model. For the case of \(0<a<1\), we show that an optimal schedule of the total completion time minimization problem is \(V\)-shaped with respect to normal job processing times.
- Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- Single-machine group scheduling problems with the sum-of-processing-time based on learning effect
- A bi-criteria two-machine flowshop scheduling problem with a learning effect
- A bi-criterion single-machine scheduling problem with learning considerations
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
- A note on the total completion time problem in a permutation flowshop with a learning effect
- A state-of-the-art review on scheduling with learning effects
- Complexity results for single-machine scheduling with positional learning effects
- Machine scheduling problems with a general learning effect
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling
- Scheduling jobs with position-dependent processing times
- Scheduling problems with a learning effect
- Single machine scheduling with learning effect considerations
- Single-machine group scheduling with a time-dependent learning effect
- Single-machine scheduling problems with a learning effect
- Single-machine scheduling problems with the time-dependent learning effect
- Single-machine scheduling with learning considerations
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Note on a single-machine scheduling problem with sum of processing times based learning and ready times
- Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
- Single-machine scheduling problems with the general sum-of-processing-time and position-dependent effect function
- Group scheduling with learning effect and random processing time
- Scheduling jobs with position and sum-of-processing-time based processing times
- A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects
- Single machine and flowshop scheduling problems with sum-of-processing time based learning phenomenon
- Single-machine scheduling with general learning functions
- Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
- A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects
- Single-machine group scheduling problems with the sum-of-processing-time based on learning effect
- Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect
- The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect
This page was built for publication: Single-machine scheduling problems with a sum-of-processing-time-based learning function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606421)
