Pages that link to "Item:Q2485174"

The following pages link to Comparison of heuristics for flowtime minimisation in permutation flowshops (Q2485174):

Displaying 27 items.

• On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
• Flowshop scheduling with a general exponential learning effect (Q336933) (← links)
• A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
• A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← 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)
• A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006) (← links)
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
• A note on the total completion time problem in a permutation flowshop with a learning effect (Q948678) (← links)
• A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
• Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates (Q1001006) (← links)
• An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem (Q1027588) (← links)
• Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization (Q1041924) (← 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)
• Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
• Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments (Q2250726) (← links)
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
• An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems (Q6065137) (← links)
• A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs (Q6070118) (← links)