A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint
- 13 August 2008
- journal article
- research article
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 43 (1-2) , 151-160
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due dateJournal of Heuristics, 2006
- A new ILS algorithm for parallel machine scheduling problemsJournal of Intelligent Manufacturing, 2006
- A simulated annealing approach to makespan minimization on identical parallel machinesThe International Journal of Advanced Manufacturing Technology, 2005
- A LISTFIT heuristic for minimizing makespan on identical parallel machinesProduction Planning & Control, 2001
- Using tabu search to solve the common due date early/tardy machine scheduling problemComputers & Operations Research, 1997
- Scheduling in flowshop and cellular manufacturing systems with multiple objectives— a genetic algorithmic approachProduction Planning & Control, 1996
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling ProblemJournal of the Operational Research Society, 1995
- Heuristics for scheduling in flowshop with multiple objectivesEuropean Journal of Operational Research, 1995
- Multiprocessor scheduling: combining LPT and MULTIFITDiscrete Applied Mathematics, 1988
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969