Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- 1 May 2009
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 194 (3) , 637-649
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problemEuropean Journal of Operational Research, 2007
- Meta-heuristics for dynamic lot sizing: A review and comparison of solution approachesEuropean Journal of Operational Research, 2007
- Scheduling unrelated parallel machines to minimize total weighted tardinessComputers & Operations Research, 2003
- Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup TimesAnnals of Operations Research, 2001
- A large step random walk for minimizing total weighted tardiness in a job shopJournal of Scheduling, 2000
- A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategiesComputers & Industrial Engineering, 1999
- A heuristic to minimize the total weighted tardiness with sequence-dependent setupsIIE Transactions, 1997
- The Total Tardiness Problem: Review and ExtensionsOperations Research, 1994
- SCHEDULING A SINGLE MACHINE TO MINIMIZE TWO CRITERIA: MAXIMUM TARDINESS AND NUMBER OF TARDY JOBSIIE Transactions, 1994
- Dominance and Decomposition Heuristics for Single Machine SchedulingOperations Research, 1991