Note on a single-machine scheduling problem with sum of processing times based learning and ready times
From MaRDI portal
(Redirected from Publication:1665710)
Recommendations
- Single-machine scheduling problems with a sum-of-processing-time-based learning function
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
- Tri-criteria single machine scheduling model with release times and learning factor
- Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
- A bi-criterion single-machine scheduling problem with learning considerations
Cites work
- A bicriteria flowshop scheduling with a learning effect
- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- A revision of some single-machine and m-machine flowshop scheduling problems with learning considerations
- A state-of-the-art review on scheduling with learning effects
- Effective heuristics for the single machine sequencing problem with ready times
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- Optimal due-date assignment problem with learning effect and resource-dependent processing times
- Scheduling jobs with position-dependent processing times
- Scheduling jobs with truncated exponential learning functions
- Single machine group scheduling with time dependent processing times and ready times
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
- Single machine scheduling with a general exponential learning effect
- Single machine scheduling with learning effect considerations
- Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- Single-machine scheduling with learning considerations
- 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 scheduling problems with general effects of learning and deterioration
Cited in
(6)- A genetic algorithm-based approach for single-machine scheduling with learning effect and release time
- Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan
- Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases
- Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
This page was built for publication: Note on a single-machine scheduling problem with sum of processing times based learning and ready times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665710)