Pages that link to "Item:Q915635"

The following pages link to Some efficient heuristic methods for the flow shop sequencing problem (Q915635):

Displaying 50 items.

• A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
• An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
• Job-shop production scheduling with reverse flows (Q319298) (← links)
• A real-time order acceptance and scheduling approach for permutation flow shop problems (Q320020) (← links)
• Carbon-efficient scheduling of flow shops by multi-objective optimization (Q320773) (← links)
• Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption (Q320777) (← links)
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
• Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← 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)
• Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
• A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
• Scheduling flow shops using differential evolution algorithm (Q817560) (← links)
• Makespan distribution of permutation flowshop schedules (Q835630) (← links)
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
• Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines (Q878937) (← links)
• Two-machine flow shop problems with a single server (Q880567) (← links)
• An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
• An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
• A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers (Q955624) (← links)
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
• An improved particle swarm optimization algorithm for flowshop scheduling problem (Q975447) (← links)
• Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem (Q1027588) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems (Q1038288) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization (Q1041924) (← links)
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
• Modified simulated annealing algorithms for the flow shop sequencing problem (Q1129912) (← links)
• Restricted neighborhood in the tabu search for the flowshop problem (Q1203798) (← links)
• An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• The generalized shifting bottleneck procedure (Q1268190) (← links)
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
• A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
• Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)