Pages that link to "Item:Q4474674"

The following pages link to Parallel flowshop scheduling using Tabu search (Q4474674):

Displaying 8 items.

• A parallel tabu search for solving the primal buffer allocation problem in serial production systems (Q342074) (← links)
• Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
• Performance evaluation of a parallel tabu search task scheduling algorithm (Q1606891) (← links)
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness (Q2387248) (← links)
• A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem (Q2664346) (← links)
• A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
• The distributed no-idle permutation flowshop scheduling problem with due windows (Q6546486) (← links)