Pages that link to "Item:Q835579"

The following pages link to A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579):

Displaying 26 items.

• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
• Improving schedule stability in single-machine rescheduling for new operation insertion (Q342084) (← links)
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← 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)
• Scheduling with returnable containers (Q906554) (← 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)
• Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars (Q1046123) (← links)
• An exact algorithm for the bi-objective timing problem (Q1653286) (← links)
• Integrated production and delivery scheduling for multi-factory supply chain with stage-dependent inventory holding cost (Q1699357) (← links)
• Scheduling with time-dependent discrepancy times (Q1702735) (← links)
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
• \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
• Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers (Q2077972) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties (Q2285347) (← 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 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)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
• Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders (Q6195034) (← links)
• Just-in-time scheduling problem with affine idleness cost (Q6555176) (← links)