Pages that link to "Item:Q2464404"

The following pages link to The one-machine problem with earliness and tardiness penalties (Q2464404):

Displaying 32 items.

• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
• EA/G-GA for single machine scheduling problems with earliness/tardiness costs (Q400876) (← links)
• Scheduling preparation of doses for a chemotherapy service (Q601167) (← links)
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
• A two-stage stochastic programming approach for project planning with uncertain activity durations (Q835555) (← links)
• Preemption in single machine earliness/tardiness scheduling (Q835565) (← 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)
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← 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)
• Non-approximability of just-in-time scheduling (Q1041346) (← links)
• Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (Q1044134) (← links)
• Optimal timing of a sequence of tasks with general completion costs (Q1776957) (← links)
• Earliness-tardiness scheduling with setup considerations (Q1777159) (← links)
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← 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 unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
• A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness (Q2450493) (← links)
• Lagrangian bounds for just-in-time job-shop scheduling (Q2456651) (← links)
• Single machine scheduling with family setups to minimize total earliness and tardiness (Q2467252) (← links)
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties (Q2483517) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem (Q2958666) (← links)
• Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders (Q6195034) (← links)