Pages that link to "Item:Q3340483"

The following pages link to Minimizing the average deviation of job completion times about a common due date (Q3340483):

Displaying 50 items.

• Minimizing weighted mean absolute deviation of job completion times from their weighted mean (Q548013) (← links)
• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden (Q579120) (← links)
• Single machine scheduling with flow time and earliness penalties (Q686991) (← 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)
• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint (Q850651) (← links)
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date (Q856323) (← links)
• A comparison of lower bounds for the single-machine early/tardy problem (Q868992) (← links)
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
• Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon (Q879577) (← links)
• Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date (Q883302) (← links)
• CON due-date determination and sequencing (Q908841) (← links)
• Scheduling about a common due date with earliness and tardiness penalties (Q908845) (← links)
• Dynamic programming approach to the single-machine sequencing problem with different due-dates (Q913669) (← links)
• Single-machine scheduling against due dates with past-sequence-dependent setup times (Q933538) (← 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)
• Non-approximability of just-in-time scheduling (Q1041346) (← links)
• A V-shape property of optimal schedule of jobs about a common due date (Q1069850) (← links)
• An algorithm for the CON due-date determination and sequencing problem (Q1097162) (← links)
• Optimal common due-date with limited completion time deviation (Q1097833) (← links)
• An alternative proof of optimality for the common due-date assignment problem (Q1107429) (← links)
• Survey of scheduling research involving due date determination decisions (Q1111925) (← links)
• V-shape property of optimal sequence of jobs about a common due date on a single machine (Q1121777) (← links)
• Single-machine scheduling with learning considerations (Q1124688) (← links)
• A fixed interval due-date scheduling problem with earliness and due-date costs (Q1127177) (← links)
• Equivalence of mean flow time problems and mean absolute deviation problems (Q1173904) (← links)
• Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine (Q1178637) (← links)
• Scheduling around a small common due date (Q1183621) (← links)
• Scheduling to minimize weighted earliness and tardiness about a common due-date (Q1186924) (← links)
• A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date (Q1195100) (← links)
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions (Q1207198) (← links)
• On the general solution for a class of early/tardy problems (Q1207204) (← links)
• Common due date scheduling problem with separate earliness and tardiness penalties (Q1207207) (← links)
• Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482) (← links)
• The APL phenomenon: An operational research perspective (Q1264098) (← links)
• Scheduling about a given common due date to minimize mean squared deviation of completion times (Q1266598) (← links)
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
• A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date (Q1278532) (← links)
• Single-machine scheduling to minimize earliness and number of tardy jobs (Q1321352) (← links)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• Due window scheduling for parallel machines (Q1341402) (← links)
• Genetic search with dynamic operating disciplines (Q1342112) (← links)
• Single machine \(\text{MAD}/T_{\max}\) problem with a common due date (Q1348560) (← links)
• Optimal common due-date with completion time tolerance (Q1360136) (← links)
• Single machine scheduling with common due data assignment in a group technology environment (Q1368494) (← links)
• The complexity of scheduling job families about a common due date (Q1376265) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)