Pages that link to "Item:Q1342312"

The following pages link to A genetic algorithm for flowshop sequencing (Q1342312):

Displaying 50 items.

• Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q279989) (← links)
• An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• Clustered enhanced differential evolution for the blocking flow shop scheduling problem (Q300862) (← links)
• Refined ranking relations for selection of solutions in multi objective metaheuristics (Q319120) (← links)
• Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
• A bi-objective integrated procurement, production, and distribution problem of a multi-echelon supply chain network design: a new tuned MOEA (Q337333) (← links)
• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q474788) (← links)
• Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
• A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues (Q726210) (← links)
• A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem (Q730912) (← links)
• Minimizing makespan for a no-wait flowshop using genetic algorithm (Q746438) (← links)
• An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
• Heuristic approaches for batching jobs in printed circuit board assembly (Q868134) (← links)
• Simple heuristics for scheduling with limited intermediate storage (Q868994) (← links)
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006) (← links)
• Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times (Q878582) (← links)
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← links)
• Scheduling mixed-model production on multiple assembly lines with shared resources using genetic algorithms: the case study of a motorbike company (Q906292) (← links)
• Fuzzy job shop scheduling with lot-sizing (Q940894) (← links)
• Comparison and hybridization of crossover operators for the nurse scheduling problem (Q940898) (← links)
• A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
• An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034) (← links)
• A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
• A GA optimization model for workgroup-based repetitive scheduling (WoRSM) (Q1005604) (← links)
• A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
• An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties (Q1017438) (← links)
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem (Q1027588) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization (Q1041924) (← links)
• A note of using effective immune based approach for the flow shop scheduling with buffers (Q1045843) (← links)
• A genetic algorithm for multi-mode resource constrained project scheduling problem (Q1278080) (← links)
• Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
• The use of genetic algorithms to solve the economic lot size scheduling problem (Q1303538) (← links)
• New bounds for optimum traffic assignment in satellite communication. (Q1406681) (← links)
• RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions. (Q1406711) (← links)
• Genetic algorithms to minimize the weighted number of late jobs on a single machine. (Q1410613) (← links)
• New heuristics for no-wait flowshops to minimize makespan. (Q1413816) (← links)
• Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
• Minimizing the makespan for the flow shop scheduling problem with availability constraints. (Q1420378) (← links)
• Impact of the replacement heuristic in a grouping genetic algorithm. (Q1422353) (← links)
• Improved genetic algorithm for the permutation flowshop scheduling problem. (Q1427101) (← links)