Pages that link to "Item:Q1317023"

The following pages link to Completion time variance minimization on a single machine is difficult (Q1317023):

Displaying 50 items.

• Variability of completion time differences in permutation flow shop scheduling (Q337356) (← links)
• Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized (Q360482) (← links)
• Minimizing weighted mean absolute deviation of job completion times from their weighted mean (Q548013) (← links)
• Total absolute deviation of job completion times on uniform and unrelated machines (Q609815) (← links)
• A lower bound for weighted completion time variance (Q613431) (← links)
• A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
• Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
• Job scheduling methods for reducing waiting time variance (Q878584) (← links)
• Mimimization of agreeably weighted variance in single machine systems (Q1127158) (← links)
• A tight lower bound for the completion time variance problem (Q1268251) (← links)
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
• Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties (Q1278719) (← links)
• Bounds for the position of the smallest job in completion time variance minimization (Q1296376) (← links)
• Complexity of a class of nonlinear combinatorial problems related to their linear counterparts (Q1328652) (← links)
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152) (← links)
• \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions (Q1390208) (← links)
• Multi-machine scheduling with variance minimization (Q1392562) (← links)
• Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Scheduling deteriorating jobs with a learning effect on unrelated parallel machines (Q1634126) (← links)
• Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
• The single machine weighted mean squared deviation problem (Q1753598) (← links)
• Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277) (← links)
• An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
• Minimization of ordered, symmetric half-products (Q1763481) (← links)
• Minimizing completion time variance with compressible processing times (Q1781972) (← 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)
• 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)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
• An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
• An exact algorithm to minimize mean squared deviation of job completion times about a common due date (Q2356179) (← links)
• Minimizing variation of production rates in just-in-time systems: A survey (Q2367376) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function (Q2459388) (← links)
• A note on lower bound for completion time variance in single machine scheduling. (Q2468562) (← links)
• Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
• Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests (Q2583511) (← 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)
• A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION (Q3013563) (← links)
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (Q3392290) (← links)
• Sequencing heuristic for bicriteria scheduling in a single machine problem (Q3411893) (← links)
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date (Q5939594) (← links)
• Algorithms for minclique scheduling problems (Q5961609) (← links)