Pages that link to "Item:Q941559"

The following pages link to Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559):

Displaying 42 items.

• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (Q337017) (← links)
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
• Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← 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)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• Total tardiness minimization in permutation flowshop with deterioration consideration (Q1630777) (← links)
• Hybrid flexible flowshop problems: models and solution methods (Q1634549) (← 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)
• A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
• Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem (Q1676480) (← links)
• A two-machine flowshop scheduling problem with precedence constraint on two jobs (Q1701710) (← links)
• Bicriterion optimization for flow shop with a learning effect subject to release dates (Q1722948) (← links)
• Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
• A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop (Q1762116) (← links)
• A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q1765532) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
• New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
• Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
• Flow shop scheduling problem with position-dependent processing times (Q2273687) (← links)
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
• Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling (Q2331444) (← links)
• Just-in-time scheduling for a distributed concrete precast flow shop system (Q2668621) (← links)
• Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem (Q2669708) (← links)
• Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
• A review and evaluation of multiobjective algorithms for the flowshop scheduling problem (Q2901027) (← links)
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization (Q2958668) (← links)
• Minimizing total tardiness in no-wait flowshops (Q2978428) (← links)
• Simulation Optimization for MRO Systems Operations (Q4978462) (← links)
• A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
• Evaluating the impact of grammar complexity in automatic algorithm design (Q6082176) (← links)
• A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
• Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)
• A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness (Q6574085) (← links)
• Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty (Q6588503) (← links)