Pages that link to "Item:Q4032593"
From MaRDI portal
The following pages link to On the Minimization of Completion Time Variance with a Bicriteria Extension (Q4032593):
Displaying 50 items.
- Minimizing weighted mean absolute deviation of job completion times from their weighted mean (Q548013) (← links)
- Convergence of the projected gradient method for quasiconvex multiobjective optimization (Q555040) (← links)
- Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
- A lower bound for weighted completion time variance (Q613431) (← links)
- Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
- Job scheduling methods for reducing waiting time variance (Q878584) (← links)
- Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences (Q980085) (← links)
- Mimimization of agreeably weighted variance in single machine systems (Q1127158) (← links)
- Scheduling about a given common due date to minimize mean squared deviation of completion times (Q1266598) (← links)
- A tight lower bound for the completion time variance problem (Q1268251) (← links)
- \(V\)-shape property for job sequences that minimize the expected completion time variance (Q1278193) (← 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)
- Completion time variance minimization on a single machine is difficult (Q1317023) (← links)
- A quadratic integer programming method for minimizing the mean squared deviation of completion times (Q1342085) (← 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)
- A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← 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)
- Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
- Strictly feasible solutions and strict complementarity in multiple objective linear optimization (Q1680765) (← links)
- Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277) (← links)
- Minimizing total completion time and total deviation of job completion times from a restrictive due-date (Q1776951) (← links)
- Minimizing completion time variance with compressible processing times (Q1781972) (← links)
- New results on the completion time variance minimization (Q1805454) (← links)
- Simultaneous minimization of total completion time and total deviation of job completion times (Q1877049) (← links)
- Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← 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)
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization (Q2026727) (← links)
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems (Q2046554) (← links)
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization (Q2114598) (← links)
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems (Q2132125) (← links)
- Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
- An exact algorithm to minimize mean squared deviation of job completion times about a common due date (Q2356179) (← links)
- Inexact projected gradient method for vector optimization (Q2377166) (← 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)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION (Q3013563) (← links)
- On the convergence of the projected gradient method for vector optimization (Q3112500) (← links)
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization (Q3383208) (← links)
- Sequencing heuristic for bicriteria scheduling in a single machine problem (Q3411893) (← links)
- Nonlinear Conjugate Gradient Methods for Vector Optimization (Q4687237) (← links)
- Convergence analysis of a projected gradient method for multiobjective optimization problems (Q5090002) (← links)
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization (Q5859003) (← links)