Pages that link to "Item:Q4678194"

The following pages link to A review and classification of heuristics for permutation flow-shop scheduling with makespan objective (Q4678194):

Displaying 50 items.

• A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
• Flowshop scheduling with a general exponential learning effect (Q336933) (← links)
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
• A generalized constructive algorithm using insertion-based heuristics (Q342160) (← 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)
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
• An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production (Q709140) (← links)
• Makespan distribution of permutation flowshop schedules (Q835630) (← links)
• A note on the total completion time problem in a permutation flowshop with a learning effect (Q948678) (← links)
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
• Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
• Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates (Q1001006) (← links)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• Trade-off balancing in scheduling for flow shop production and perioperative processes (Q1631497) (← 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)
• Bicriterion optimization for flow shop with a learning effect subject to release dates (Q1722948) (← links)
• Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← 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)
• A three-phase algorithm for flowshop scheduling with blocking to minimize makespan (Q1761237) (← links)
• A self-guided genetic algorithm for permutation flowshop scheduling problems (Q1762134) (← 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)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
• A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
• A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production (Q2293881) (← links)
• Machine scheduling in production: a content analysis (Q2294174) (← links)
• Heuristic for stochastic online flowshop problem with preemption penalties (Q2312307) (← links)
• An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
• Flowshop scheduling research after five decades (Q2572844) (← links)
• A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
• Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← 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 hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems (Q2967585) (← links)
• EVALUATING PERFORMANCE OF FLOW LINE SYSTEMS WITH BLOCKING UNDER FUZZY ENVIRONMENTS (Q3393514) (← links)
• Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup (Q3621499) (← links)
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
• An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) (← links)