Pages that link to "Item:Q337260"

The following pages link to A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260):

Displaying 15 items.

• Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
• Trade-off balancing in scheduling for flow shop production and perioperative processes (Q1631497) (← links)
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic (Q1651546) (← links)
• Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
• A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
• Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
• Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
• A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs (Q6070118) (← links)
• An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378) (← links)
• Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)