Pages that link to "Item:Q1963033"

The following pages link to A branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033):

Displaying 8 items.

• EA/G-GA for single machine scheduling problems with earliness/tardiness costs (Q400876) (← links)
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
• A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties (Q838299) (← links)
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
• Bi-objective single machine scheduling problem with stochastic processing times (Q2343079) (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem (Q2958666) (← links)