Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm
From MaRDI portal
Publication:2403558
DOI10.1007/s12046-016-0575-7zbMath1370.90111MaRDI QIDQ2403558
Isam A. Q. Elbadawi, Imran Ali Chaudry
Publication date: 8 September 2017
Published in: Sādhanā (Search for Journal in Brave)
Full work available at URL: https://www.ias.ac.in/describe/article/sadh/042/01/0011-0021
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling on parallel identical machines to minimize total tardiness
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Sequence optimization and design of allocation using GA and SA
- A genetic algorithm for flowshop sequencing
- Approximative procedures for no-wait job shop scheduling.
- A tabu search algorithm for parallel machine total tardiness problem
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
- Optimization of aircraft maintenance/support infrastructure using genetic algorithms -- level of repair analysis
- A dual algorithm for the one-machine scheduling problem
- Ordonnancements à contraintes disjonctives
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Scheduling with Deadlines and Loss Functions on k Parallel Machines
- Heuristic for no-wait flow shops with makespan minimization