A genetic algorithm for flowshop sequencing

From MaRDI portal

Publication:1342312

Jump to:navigation, search

DOI10.1016/0305-0548(93)E0014-KzbMath0815.90097MaRDI QIDQ1342312

Colin R. Reeves

Publication date: 13 February 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

simulated annealing genetic algorithms makespan \(n\)-job, \(m\)-machine permutation flowshop sequencing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Genetics and epigenetics (92D10)

Related Items

STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM, A genetic algorithm on multiple sequences alignment problems in biology, An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem, Adaptive variable neighbourhood search approach for time-dependent joint location and dispatching problem in a multi-tier ambulance system, An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine, Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery, A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan, The seeds of the NEH algorithm: an overview using bibliometric analysis, Scheduling of multiple in-line steppers for semiconductor wafer fabs, Using genetic algorithms (GA) and a coloured timed Petri net (CTPN) for modelling the optimization-based schedule generator of a generic production scheduling system, Algorithmical approaches to business process design, CF-GGA: A grouping genetic algorithm for the cell formation problem, Flowshop-scheduling problems with makespan criterion: a review, Genetic algorithms and simulated annealing for scheduling in agile manufacturing, Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues, Forward Backward Transformation, Unnamed Item, Unnamed Item, Proactive Scheduling for Steelmaking-Continuous Casting Plant with Uncertain Machine Breakdown Using Distribution-Based Robustness and Decomposed Artificial Neural Network, Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm, Scheduling semiconductor in-line steppers in new product/process introduction scenarios, A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan, A neuro-tabu search heuristic for the flow shop scheduling problem, Flow-shop scheduling for three serial stations with the last two duplicate, An effective differential evolution algorithm for permutation flow shop scheduling problem, New hard benchmark for flowshop scheduling problems minimising makespan, Clustered enhanced differential evolution for the blocking flow shop scheduling problem, \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems, Setup coordination between two stages of a production system: a multi-objective evolutionary approach, Refined ranking relations for selection of solutions in multi objective metaheuristics, A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS, Some local search algorithms for no-wait flow-shop problem with makespan criterion, A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups, Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms, An exact parallel method for a bi-objective permutation flowshop problem, 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, A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion, A bi-objective integrated procurement, production, and distribution problem of a multi-echelon supply chain network design: a new tuned MOEA, Reduction of permutation flowshop problems to single machine problems using machine dominance relations, Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops, Heuristic approaches for batching jobs in printed circuit board assembly, Simple heuristics for scheduling with limited intermediate storage, Parallel partitioning method (PPM): A new exact method to solve bi-objective problems, Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm, Hybrid genetic algorithms for bin-packing and related problems, A comparison of local search methods for flow shop scheduling, Metaheuristics: A bibliography, Solving permutation flow shop scheduling problem with sequence-independent setup time, Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times, A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems, A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM, A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem, Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization, GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs, New bounds for optimum traffic assignment in satellite communication., RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions., Scheduling mixed-model production on multiple assembly lines with shared resources using genetic algorithms: the case study of a motorbike company, A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems, Genetic algorithms to minimize the weighted number of late jobs on a single machine., New heuristics for no-wait flowshops to minimize makespan., Approximative procedures for no-wait job shop scheduling., Minimizing the makespan for the flow shop scheduling problem with availability constraints., Impact of the replacement heuristic in a grouping genetic algorithm., Harmony search algorithm with dynamic control parameters, Improved genetic algorithm for the permutation flowshop scheduling problem., Improved bounded dynamic programming algorithm for solving the blocking flow shop problem, Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm, An ant colony system for permutation flow-shop sequencing, Smart Production by Integrating Product-Mix Planning and Revenue Management for Semiconductor Manufacturing, Fuzzy job shop scheduling with lot-sizing, Comparison and hybridization of crossover operators for the nurse scheduling problem, A proposal for a hybrid meta-strategy for combinatorial optimization problems, An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers, A memetic algorithm for the job-shop with time-lags, A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria, Fitness landscape analysis for the no-wait flow-shop scheduling problem, No-wait job shop scheduling: tabu search and complexity of subproblems, A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem, Design of an adaptive mutation operator in an electrical load management case study, An improved NEH heuristic to minimize makespan in permutation flow shops, Heuristics for a flowshop scheduling problem with stepwise job objective function, Cloud manufacturing -- scheduling as a service for sheet metal manufacturing, An evolutionary approach to rehabilitation patient scheduling: A case study, Parallel hybrid heuristics for the permutation flow shop problem, A self-guided genetic algorithm for permutation flowshop scheduling problems, An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Stochastic optimization using simulated annealing with hypothesis test, A hybrid scatter search heuristic for personalized crew rostering in the airline industry, A comprehensive review and evaluation of permutation flowshop heuristics, Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, A computational study of the permutation flow shop problem based on a tight lower bound, An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers, An improved genetic algorithm for the flowshop scheduling problem, A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues, A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem, A GA optimization model for workgroup-based repetitive scheduling (WoRSM), Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems, A genetic algorithm for the proportionate multiprocessor open shop, An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems, A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems, COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM, Formulating and solving production planning problems, Minimizing makespan for a no-wait flowshop using genetic algorithm, Mixed integer linear programming models for flow shop scheduling with a demand plan of job types, A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties, A hybrid genetic local search algorithm for the permutation flowshop scheduling problem, A genetic algorithm for multi-mode resource constrained project scheduling problem, The distributed permutation flowshop scheduling problem, Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, A note of using effective immune based approach for the flow shop scheduling with buffers, Some results of the worst-case analysis for flow shop scheduling, Some aspects of scatter search in the flow-shop problem, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach, The use of genetic algorithms to solve the economic lot size scheduling problem

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1342312&oldid=13473805"