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.

• Scheduling with time-dependent discrepancy times (Q1702735) (← links)
• The single machine weighted mean squared deviation problem (Q1753598) (← links)
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey (Q1765094) (← links)
• On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties (Q1765543) (← links)
• Minimizing total completion time and total deviation of job completion times from a restrictive due-date (Q1776951) (← 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)
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs (Q1807950) (← links)
• Single machine scheduling to minimize mean absolute lateness: A heuristic solution (Q1823851) (← 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)
• 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)
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs (Q1892102) (← 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)
• Common due-date determination and sequencing using tabu search (Q1915955) (← links)
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033) (← links)
• Dominance inequalities for scheduling around an unrestrictive common due date (Q2242293) (← 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)
• Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights (Q2307497) (← links)
• An exact algorithm to minimize mean squared deviation of job completion times about a common due date (Q2356179) (← links)
• Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252) (← links)
• Scheduling with monotonous earliness and tardiness penalties (Q2366084) (← links)
• Minimizing variation of production rates in just-in-time systems: A survey (Q2367376) (← links)
• Earliness--tardiness production planning for just-in-time manufacturing: a unifying approach by goal programming (Q2432869) (← links)
• Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
• Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain (Q2463495) (← links)
• A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Minimizing flowtime and missed due-dates in single-machine sequencing (Q2640435) (← links)
• Multicriteria scheduling problems: a survey (Q2773166) (← links)
• Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
• Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
• A Meta-RaPS for the early/tardy single machine scheduling problem (Q3055652) (← links)
• Mean completion time for a randomly varying rate of work (Q3383681) (← links)
• Minimization of total absolute deviation for a common due date (Q3534456) (← links)
• Minimizing mean absolute deviation of completion times about a common due date (Q3735428) (← links)
• Single- and multiple-processor models for minimizing completion time variance (Q3735434) (← links)
• Determination of an optimal common due date and optimal sequence in a single machine job shop (Q3787779) (← links)
• Optimal constant due-date assignment and sequencing (Q3789321) (← links)
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date (Q3806975) (← links)
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date (Q3988911) (← links)
• A dual criteria sequencing problem with earliness and tardiness penalties (Q4552543) (← links)
• Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date (Q4634328) (← links)
• Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date (Q4733656) (← links)