Pages that link to "Item:Q5059372"

The following pages link to A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration (Q5059372):

Displaying 7 items.

• Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop (Q602916) (← links)
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic (Q1651546) (← links)
• Two-stage assembly scheduling with batch setup times, time-dependent deterioration, and preventive maintenance activities using meta-heuristic algorithms (Q1721321) (← links)
• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect (Q1727266) (← links)
• The due date assignment scheduling problem with the deteriorating jobs and delivery time (Q2089176) (← links)
• Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect (Q2152905) (← links)
• A two-stage three-machine flow shop assembly problem mixed with a controllable number and sum-of-processing times-based learning effect by simulated annealing algorithms (Q2213408) (← links)