Pages that link to "Item:Q2467260"
From MaRDI portal
The following pages link to An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260):
Displaying 50 items.
- New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
- Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption (Q320777) (← links)
- A high performing metaheuristic for multi-objective flowshop scheduling problem (Q337199) (← links)
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach (Q497626) (← links)
- A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
- Scheduling open shops with parallel machines to minimize total completion time (Q609214) (← links)
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates (Q614053) (← links)
- Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system (Q781099) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry (Q992661) (← links)
- Shifting representation search for hybrid flexible flowline problems (Q992723) (← links)
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times (Q1000975) (← links)
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
- A knowledge-based approach for multi-factory production systems (Q1652022) (← links)
- Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study (Q1652149) (← links)
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
- An iterated greedy heuristic for a market segmentation problem with multiple attributes (Q1753559) (← links)
- Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
- Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm (Q1793174) (← links)
- Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
- A two-stage solution approach for the directed rural postman problem with turn penalties (Q1991193) (← links)
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search (Q2003564) (← links)
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion (Q2004870) (← links)
- A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data (Q2070120) (← links)
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning (Q2077963) (← links)
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times (Q2146995) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- Solving permutation flow shop scheduling problem with sequence-independent setup time (Q2176034) (← links)
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects (Q2195404) (← links)
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs (Q2225197) (← links)
- Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
- Iterated greedy for the maximum diversity problem (Q2275623) (← links)
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561) (← links)
- Tabu search for min-max edge crossing in graphs (Q2337395) (← 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)
- Multi-objective iterated greedy variable neighborhood search algorithm for solving a full-load automated guided vehicle routing problem with battery constraints (Q2631250) (← links)
- Just-in-time scheduling for a distributed concrete precast flow shop system (Q2668621) (← links)
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
- Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry) (Q2676023) (← links)
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem (Q2676278) (← links)
- An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns (Q3055224) (← links)
- Scheduling job shop problems with sequence-dependent setup times (Q3055268) (← links)
