Pages that link to "Item:Q1752855"

The following pages link to A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855):

Displaying 39 items.

• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
• Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
• Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
• Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
• Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion (Q2003413) (← links)
• Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective (Q2003565) (← links)
• A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion (Q2004870) (← links)
• Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning (Q2077963) (← links)
• Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem (Q2079447) (← links)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← 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)
• Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
• A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
• A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
• A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
• The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem (Q2242240) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
• Mixed integer linear programming models for flow shop scheduling with a demand plan of job types (Q2303310) (← links)
• The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724) (← links)
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
• Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem (Q2664317) (← links)
• \(N\)-NEH+ algorithm for solving permutation flow shop problems (Q2668738) (← links)
• New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
• Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
• An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) (← links)
• On some lower bounds for the permutation flowshop problem (Q6047866) (← links)
• Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
• An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems (Q6065137) (← links)
• A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
• A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs (Q6070118) (← links)
• Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization (Q6094862) (← links)
• Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach (Q6109307) (← links)
• Flowshop with additional resources during setups: mathematical models and a GRASP algorithm (Q6109559) (← links)
• A systematic literature review on no-idle flow shop scheduling problem (Q6130678) (← links)
• The seeds of the NEH algorithm: an overview using bibliometric analysis (Q6200788) (← links)