Pages that link to "Item:Q817122"

The following pages link to A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122):

Displaying 18 items.

• Clustered enhanced differential evolution for the blocking flow shop scheduling problem (Q300862) (← links)
• Optimizing blocking flow shop scheduling problem with total completion time criterion (Q336393) (← links)
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
• An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems (Q1038288) (← links)
• An optimization-based heuristic for the robotic cell problem (Q1040983) (← links)
• Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking (Q1615967) (← links)
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
• Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
• Improved bounded dynamic programming algorithm for solving the blocking flow shop problem (Q1725819) (← links)
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems (Q1761190) (← links)
• A three-phase algorithm for flowshop scheduling with blocking to minimize makespan (Q1761237) (← links)
• Mixed integer linear programming models for flow shop scheduling with a demand plan of job types (Q2303310) (← links)
• A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking (Q2423281) (← links)
• Surgical case scheduling as a generalized job shop scheduling problem (Q2464181) (← links)
• An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (Q2475841) (← links)
• An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers (Q3596695) (← links)