Pages that link to "Item:Q2491772"

The following pages link to Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772):

Displaying 12 items.

• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
• An improved earliness--tardiness timing algorithm (Q878565) (← links)
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
• The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
• A new model for the preemptive earliness-tardiness scheduling problem (Q1013402) (← links)
• Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (Q1044134) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
• A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← links)
• Lagrangian bounds for just-in-time job-shop scheduling (Q2456651) (← links)
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)