A genetic algorithm for flow shop scheduling problems
From MaRDI portal
Publication:4661056
DOI10.1057/palgrave.jors.2601766zbMath1060.90035MaRDI QIDQ4661056
No author found.
Publication date: 4 April 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601766
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times, A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function, A discrete version of particle swarm optimization for flowshop scheduling problems, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Order acceptance using genetic algorithms, Minimizing total tardiness on a single machine with controllable processing times, An empirical analysis of the optimality rate of flow shop heuristics, Solving a two-agent single-machine scheduling problem considering learning effect, A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
