Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
From MaRDI portal
Publication:622157
DOI10.1016/j.cor.2010.11.001zbMath1205.90139MaRDI QIDQ622157
Peng-Hsiang Hsu, Chin-Chia Wu, Juei-Chao Chen, Nae-Sheng Wang
Publication date: 31 January 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.11.001
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm, 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, Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times, Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects, Scheduling with job-splitting considering learning and the vital-few law, Multiple-machine scheduling with learning effects and cooperative games, Note on a single-machine scheduling problem with sum of processing times based learning and ready times, Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning, A genetic algorithm-based approach for single-machine scheduling with learning effect and release time, On interactive sequencing situations with exponential cost functions, Single-machine scheduling and due date assignment with rejection and position-dependent processing times, Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
- Path planning on a cuboid using genetic algorithms
- A due-date assignment problem with learning effect and deteriorating jobs
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
- 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
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with learning considerations
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- The learning effect: getting to the core of the problem
- Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
- Single-machine scheduling with general learning functions
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A state-of-the-art review on scheduling with learning effects
- 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
- Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
- Single machine scheduling with a time-dependent learning effect and deteriorating jobs
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A genetic algorithm for flow shop scheduling problems
- Scheduling jobs with position-dependent processing times
- Single machine scheduling with learning effect considerations
