Pages that link to "Item:Q2485328"

The following pages link to A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328):

Displaying 10 items.

• Parallel machines scheduling with machine preference via agent-based approach (Q272606) (← links)
• An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times (Q418297) (← links)
• Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154) (← links)
• Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
• Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
• A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times (Q2285809) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• Parallel machine scheduling with preference of machines (Q3163231) (← links)
• Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry (Q5257894) (← links)