Pages that link to "Item:Q5953167"

The following pages link to Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates (Q5953167):

Displaying 27 items.

• Temporal linear relaxation in IBM ILOG CP optimizer (Q309055) (← links)
• Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance (Q337029) (← links)
• Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
• On scheduling around large restrictive common due windows (Q704121) (← links)
• Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date (Q856323) (← links)
• A differential evolution approach for the common due date early/tardy job scheduling problem (Q941556) (← links)
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
• Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)
• Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403) (← links)
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date (Q1887879) (← links)
• Common due date scheduling with autonomous and induced learning (Q1887957) (← links)
• On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date (Q1926635) (← links)
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
• Dominance inequalities for scheduling around an unrestrictive common due date (Q2242293) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs (Q2337385) (← links)
• Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
• Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date (Q2883598) (← links)
• Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness (Q2958669) (← links)
• STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM (Q4781293) (← links)
• Multiple machine JIT scheduling: a tabu search approach (Q5428715) (← links)
• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights (Q6059906) (← links)
• Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window (Q6164365) (← links)
• Self-adaptive biased differential evolution for scheduling against common due dates (Q6579091) (← links)