Pages that link to "Item:Q1772850"

The following pages link to A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850):

Displaying 50 items.

• A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
• A real-time order acceptance and scheduling approach for permutation flow shop problems (Q320020) (← links)
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
• Effect of solution representations on tabu search in scheduling applications (Q336636) (← links)
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
• Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
• A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
• A cooperative hyper-heuristic search framework (Q604941) (← links)
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
• A unified framework for population-based metaheuristics (Q646652) (← links)
• An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production (Q709140) (← links)
• Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (Q711284) (← links)
• Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
• A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
• Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times (Q878582) (← links)
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times (Q879286) (← links)
• Considering scheduling and preventive maintenance in the flowshop sequencing problem (Q883296) (← links)
• Scheduling mixed-model production on multiple assembly lines with shared resources using genetic algorithms: the case study of a motorbike company (Q906292) (← links)
• An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
• A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
• Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
• Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines (Q962838) (← links)
• Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
• Shifting representation search for hybrid flexible flowline problems (Q992723) (← links)
• Order acceptance using genetic algorithms (Q1000954) (← links)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling (Q1628124) (← links)
• Trade-off balancing in scheduling for flow shop production and perioperative processes (Q1631497) (← links)
• Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
• A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
• Fragmentary structures in discrete optimization problems (Q1699407) (← links)
• Bicriterion optimization for flow shop with a learning effect subject to release dates (Q1722948) (← links)