Pages that link to "Item:Q2901056"

The following pages link to New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling (Q2901056):

Displaying 31 items.

• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
• Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
• Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
• Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (Q1044134) (← links)
• Scheduling with time-dependent discrepancy times (Q1702735) (← links)
• The single machine weighted mean squared deviation problem (Q1753598) (← links)
• Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times (Q1754111) (← links)
• An exact approach for scheduling jobs with regular step cost functions on a single machine (Q1762077) (← links)
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
• Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs (Q2027084) (← links)
• Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers (Q2077972) (← links)
• Dominance inequalities for scheduling around an unrestrictive common due date (Q2242293) (← links)
• An exact algorithm for single-machine scheduling without machine idle time (Q2268522) (← links)
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties (Q2285347) (← links)
• The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← 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)
• A linear programming-based method for job shop scheduling (Q2434310) (← links)
• Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
• A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861) (← links)
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem (Q2958666) (← links)
• Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
• An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems (Q5139849) (← links)
• Data analytics and stochastic modeling in a semiconductor fab (Q5391290) (← links)
• Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders (Q6195034) (← links)
• Self-adaptive general variable neighborhood search algorithm for parallel machine scheduling with unrelated servers (Q6551084) (← links)
• Integrated production and transportation scheduling problem under nonlinear cost structures (Q6555171) (← links)
• New exact and heuristic algorithms for general production and delivery integration (Q6565384) (← links)