Pages that link to "Item:Q2482802"

The following pages link to Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802):

Displaying 23 items.

• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
• Scheduling preparation of doses for a chemotherapy service (Q601167) (← links)
• A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
• Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← links)
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
• Scheduling with earliness-tardiness penalties and parallel machines (Q941007) (← links)
• Online scheduling of malleable parallel jobs with setup times on two identical machines (Q976487) (← links)
• Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (Q1044134) (← links)
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
• Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers (Q2077972) (← links)
• A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← 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)
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
• Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
• Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization (Q2958668) (← links)
• Capacity allocation in a service system with preferred service completion times (Q6077481) (← links)
• Dynamic scheduling of patients in emergency departments (Q6113312) (← links)