Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
From MaRDI portal
Publication:958545
DOI10.1016/j.ejor.2007.10.063zbMath1163.90004OpenAlexW1994806929MaRDI QIDQ958545
Waiman Cheung, Lawrence C. Leung, Hong Zhou
Publication date: 5 December 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.10.063
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (17)
RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect ⋮ Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates ⋮ Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ Dispatching problems for parallel machines in the TFT‐LCD assembly process ⋮ A hybrid differential evolution and tree search algorithm for the job shop scheduling problem ⋮ A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm ⋮ A general approach for optimizing regular criteria in the job-shop scheduling problem ⋮ Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling ⋮ A poly-hybrid PSO optimization method with intelligent parameter adjustment ⋮ A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan ⋮ Bi-criteria assembly line balancing by considering flexible operation times ⋮ Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems ⋮ A meta-heuristic to solve the just-in-time job-shop scheduling problem ⋮ A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- A genetic algorithm for the job shop problem
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- A large step random walk for minimizing total weighted tardiness in a job shop
- Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times
- A comparative study of dispatching rules in dynamic flowshops and jobshops
- Dominance and Decomposition Heuristics for Single Machine Scheduling
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A genetic algorithm methodology for complex scheduling problems
- Weighted Tardiness Single Machine Scheduling with Proportional Weights
- The Total Tardiness Problem: Review and Extensions
This page was built for publication: Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
