Pages that link to "Item:Q342177"

The following pages link to Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177):

Displaying 10 items.

• A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940) (← links)
• Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (Q2029256) (← links)
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
• The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
• A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation (Q2572847) (← links)
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions (Q3974115) (← links)
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective (Q4678194) (← links)
• Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach (Q6109307) (← links)