Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
From MaRDI portal
(Redirected from Publication:622157)
Recommendations
- A genetic algorithm-based approach for single-machine scheduling with learning effect and release time
- Scheduling with a position-weighted learning effect and job release dates
- Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- Tri-criteria single machine scheduling model with release times and learning factor
Cites work
- scientific article; zbMATH DE number 91757 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- A due-date assignment problem with learning effect and deteriorating jobs
- A genetic algorithm for flow shop scheduling problems
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A new approach to the learning effect: Beyond the learning curve restrictions
- A state-of-the-art review on scheduling with learning effects
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- Machine scheduling problems with a general learning effect
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- Path planning on a cuboid using genetic algorithms
- Scheduling jobs with position-dependent processing times
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
- Single machine scheduling with a time-dependent learning effect and deteriorating jobs
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
- Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
- Single machine scheduling with learning effect considerations
- Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
- Single-machine scheduling with general learning functions
- 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
- The learning effect: getting to the core of the problem
Cited in
(23)- Permutation flow shop scheduling with makespan objective and truncated learning effects
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration
- Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm
- On interactive sequencing situations with exponential cost functions
- Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints
- Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times
- Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates
- Genetic algorithm for a two-agent scheduling problem with truncated learning consideration
- Scheduling with job-splitting considering learning and the vital-few law
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times
- Multiple-machine scheduling with learning effects and cooperative games
- Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models
- Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
- Note on a single-machine scheduling problem with sum of processing times based learning and ready times
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Scheduling with a position-weighted learning effect and job release dates
- Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times
- An optimal online algorithm for single-processor scheduling problem with learning effect
- A genetic algorithm-based approach for single-machine scheduling with learning effect and release time
This page was built for publication: Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622157)
