Pages that link to "Item:Q1427562"

The following pages link to Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. (Q1427562):

Displaying 50 items.

• An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
• A real-time order acceptance and scheduling approach for permutation flow shop problems (Q320020) (← links)
• A two-phase scheduling method with the consideration of task clustering for Earth observing satellites (Q336398) (← links)
• A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
• An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed (Q632673) (← links)
• A unified framework for population-based metaheuristics (Q646652) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• An ant colony optimization algorithm for shop scheduling problems (Q702768) (← 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)
• A discrete version of particle swarm optimization for flowshop scheduling problems (Q878589) (← links)
• Considering scheduling and preventive maintenance in the flowshop sequencing problem (Q883296) (← links)
• Ant colony optimization for the job rotation scheduling problem (Q945229) (← links)
• A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
• Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
• An improved particle swarm optimization algorithm for flowshop scheduling problem (Q975447) (← links)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times (Q1000975) (← links)
• An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem (Q1027588) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization (Q1041924) (← links)
• An ant colony system for permutation flow-shop sequencing (Q1433172) (← links)
• A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem (Q1652147) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem (Q1848361) (← links)
• Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
• Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
• Using artificial bee colony algorithm for permutation flow shop scheduling problem under makespan criterion (Q2263748) (← links)
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
• A heuristic approach to find the global optimum of function (Q2475339) (← links)
• An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs (Q2566710) (← links)
• Allocation of advertising space by a web service provider using combinatorial auctions (Q2571440) (← links)
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852) (← links)
• Scheduling job shop associated with multiple routings with genetic and ant colony heuristics (Q3055377) (← links)
• Design and validation of heuristic algorithms for simulation-based scheduling of a semiconductor Backend facility (Q3055648) (← links)
• Permutation flow shop scheduling algorithm based on ant colony optimization (Q3185503) (← links)
• An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions (Q3509420) (← links)
• Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach (Q3527930) (← links)
• USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS (Q3638815) (← links)
• A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test (Q3643081) (← links)
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
• A heuristic hybrid framework for vector job scheduling (Q4987672) (← links)