Pages that link to "Item:Q3777790"
From MaRDI portal
The following pages link to Minimizing Mean Squared Deviation of Completion Times About a Common Due Date (Q3777790):
Displayed 50 items.
- Variability of completion time differences in permutation flow shop scheduling (Q337356) (← links)
- A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden (Q579120) (← links)
- A lower bound for weighted completion time variance (Q613431) (← links)
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
- Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
- Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
- Two due date assignment problems in scheduling a single machine (Q867932) (← links)
- Scheduling about a common due date with earliness and tardiness penalties (Q908845) (← links)
- Parametric precedence relations in single machine scheduling (Q916560) (← links)
- Single machine stochastic JIT scheduling problem subject to machine breakdowns (Q931488) (← links)
- Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties (Q943438) (← links)
- Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
- Survey of scheduling research involving due date determination decisions (Q1111925) (← links)
- Scheduling to minimize weighted earliness and tardiness about a common due-date (Q1186924) (← 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)
- Scheduling about a given common due date to minimize mean squared deviation of completion times (Q1266598) (← links)
- Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method (Q1266599) (← links)
- A tight lower bound for the completion time variance problem (Q1268251) (← links)
- Bounds for the position of the smallest job in completion time variance minimization (Q1296376) (← links)
- Minimizing flow time variance in a single machine system using genetic algorithms (Q1310012) (← links)
- A quadratic integer programming method for minimizing the mean squared deviation of completion times (Q1342085) (← links)
- Genetic search with dynamic operating disciplines (Q1342112) (← links)
- Single machine \(\text{MAD}/T_{\max}\) problem with a common due date (Q1348560) (← links)
- Single machine scheduling with common due data assignment in a group technology environment (Q1368494) (← links)
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152) (← links)
- A semi-infinite programming model for earliness/tardiness production planning with simulated annealing (Q1376761) (← links)
- \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions (Q1390208) (← 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)
- The single machine weighted mean squared deviation problem (Q1753598) (← links)
- An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (Q1785249) (← links)
- New results on the completion time variance minimization (Q1805454) (← links)
- Single machine scheduling to minimize mean absolute lateness: A heuristic solution (Q1823851) (← links)
- Optimal sequences in stochastic single machine shops (Q1919778) (← links)
- A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm (Q1921211) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- A branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033) (← links)
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
- An exact algorithm to minimize mean squared deviation of job completion times about a common due date (Q2356179) (← links)
- Scheduling with monotonous earliness and tardiness penalties (Q2366084) (← links)
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function (Q2459388) (← links)
- Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model (Q2471329) (← links)
- A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- Solving a stochastic single machine problem with initial idle time and quadratic objective (Q2655649) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- Design of predictable production scheduling model using control theoretic approach (Q3055450) (← links)