Pages that link to "Item:Q3735428"

The following pages link to Minimizing mean absolute deviation of completion times about a common due date (Q3735428):

Displaying 50 items.

• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
• A note on mean absolute deviation (Q506352) (← links)
• 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)
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
• Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
• Two due date assignment problems in scheduling a single machine (Q867932) (← links)
• A comparison of lower bounds for the single-machine early/tardy problem (Q868992) (← 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)
• Parametric precedence relations in single machine scheduling (Q916560) (← links)
• A differential evolution approach for the common due date early/tardy job scheduling problem (Q941556) (← links)
• Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties (Q943438) (← links)
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
• Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← 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)
• 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)
• Scheduling around a small common due date (Q1183621) (← links)
• Scheduling to minimize weighted earliness and tardiness about a common due-date (Q1186924) (← links)
• Single machine scheduling with coefficient of variation minimization (Q1205688) (← links)
• V-shape property for optimal schedules with monotone penalty functions (Q1206390) (← 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)
• 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)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• Genetic search with dynamic operating disciplines (Q1342112) (← links)
• Single machine \(\text{MAD}/T_{\max}\) problem with a common due date (Q1348560) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties (Q1765543) (← links)
• Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403) (← links)
• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem (Q1793464) (← links)
• Single machine earliness-tardiness scheduling with resource-dependent release dates (Q1847239) (← links)
• Simultaneous minimization of total completion time and total deviation of job completion times (Q1877049) (← links)
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time (Q1885972) (← links)
• Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs (Q1892102) (← links)
• Processing-plus-wait due dates in single-machine scheduling (Q1893346) (← links)
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem (Q1893607) (← links)
• An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date (Q1905077) (← links)
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033) (← links)
• Algorithms for a class of single-machine weighted tardiness and earliness problems (Q2277355) (← links)
• Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)