Pages that link to "Item:Q2901015"

The following pages link to Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem (Q2901015):

Displaying 15 items.

• A composite algorithm for multiprocessor scheduling (Q544815) (← links)
• A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
• Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) (← links)
• Optimal and heuristic solution methods for a multiprocessor machine scheduling problem (Q1017458) (← links)
• Minimizing the makespan on two identical parallel machines with mold constraints (Q1722974) (← links)
• Block rearranging elements within matrix columns to minimize the variability of the row sums (Q1743640) (← links)
• Two branch-and-bound algorithms for the robust parallel machine scheduling problem (Q1762154) (← links)
• Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
• Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
• Friendly bin packing instances without integer round-up property (Q2340275) (← links)
• An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
• A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
• Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
• Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem (Q5086007) (← links)