Pages that link to "Item:Q857345"

The following pages link to A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345):

Displaying 50 items.

• Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564) (← links)
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
• Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm (Q2514834) (← links)
• Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time (Q2629637) (← links)
• Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling (Q2630226) (← links)
• Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant (Q2664430) (← links)
• Just-in-time scheduling for a distributed concrete precast flow shop system (Q2668621) (← links)
• A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands (Q2668800) (← links)
• Solving real-size stochastic railway rapid transit network construction scheduling problems (Q2669704) (← links)
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
• Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
• Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows (Q2673560) (← links)
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem (Q2676278) (← links)
• Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters (Q2676401) (← links)
• New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness (Q3055285) (← links)
• An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks (Q3184454) (← links)
• The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches (Q3304199) (← links)
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (Q3605449) (← links)
• Discrete/Binary Approach (Q3649626) (← links)
• An Artificial Bee Colony Based Hyper-heuristic for the Single Machine Order Acceptance and Scheduling Problem (Q4613886) (← links)
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
• Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997) (← links)
• A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324) (← links)
• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q5172564) (← links)
• An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem (Q5174415) (← links)
• Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II (Q6047920) (← links)
• An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
• An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems (Q6065137) (← links)
• Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem (Q6065188) (← links)
• Particle therapy patient scheduling with limited starting time variations of daily treatments (Q6066719) (← links)
• An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem (Q6066726) (← links)
• A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
• A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
• Stochastic local search and parameters recommendation: a case study on flowshop problems (Q6079864) (← links)
• Evaluating the impact of grammar complexity in automatic algorithm design (Q6082176) (← links)
• An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378) (← links)
• Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem (Q6096611) (← links)
• An iterated greedy algorithm for finding the minimum dominating set in graphs (Q6102924) (← links)
• Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
• An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)
• Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing (Q6151475) (← links)
• Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
• An effective population-based iterated greedy algorithm for solving the multi-AGV scheduling problem with unloading safety detection (Q6179985) (← links)
• A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness (Q6193912) (← links)
• The seeds of the NEH algorithm: an overview using bibliometric analysis (Q6200788) (← links)
• An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times (Q6489312) (← links)
• The distributed no-idle permutation flowshop scheduling problem with due windows (Q6546486) (← links)
• Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates (Q6554640) (← links)