Pages that link to "Item:Q1389189"

The following pages link to A heuristic algorithm for mean flowtime objective in flowshop scheduling (Q1389189):

Displaying 28 items.

• Several flow shop scheduling problems with truncated position-based learning effect (Q336658) (← links)
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← 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)
• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
• Heuristics for search sequencing under time-dependent probabilities of existence (Q868139) (← links)
• An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← 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)
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. (Q1427562) (← links)
• Concurrent flowshop scheduling to minimize makespan. (Q1429959) (← links)
• A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q1765532) (← links)
• Two-machine flowshop scheduling with job class setups to minimize total flowtime (Q1781550) (← links)
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation (Q1847225) (← links)
• The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime (Q1869720) (← links)
• Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments (Q2250726) (← links)
• Comparison of heuristics for flowtime minimisation in permutation flowshops (Q2485174) (← links)
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs (Q2566710) (← links)
• Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
• A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP (Q5708850) (← links)
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem (Q5946533) (← links)