The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10288-011-0180-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973197094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine flow-time scheduling with a single breakdown / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Problems with Two Competing Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of Half-Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic resource allocation with generalized upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mimimization of agreeably weighted variance in single machine systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A half-product based approximation scheme for agreeably weighted completion time variance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising Waiting Time Variance in the Single Machine Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Sequencing on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPTAS for half-products minimization with scheduling applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for convex network optimization and other nonlinear problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Lower and Upper Bounds for Scheduling Around a Small Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling around a small common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some comments on sequencing with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive half-products and scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for minclique scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Variation of Flow Time in Single Machine Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fully polynomial approximation scheme for the Subset-Sum problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fully polynomial time approximation scheme for the Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming in connection with an FPTAS for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for minimizing the total weighted tardiness on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion time variance minimization on a single machine is difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the completion time variance minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of ordered, symmetric half-products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast fully polynomial approximation schemes for minimizing completion time variance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop no-wait scheduling with machine maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning Machine Maintenance in Two-Machine Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan in a single machine scheduling problem with a time-based learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variance Minimization in Single Machine Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of concave knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of results for sequencing problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic 0-1 knapsack problem with series-parallel support / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a nonseparable convex maximization problem with continuous Knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with controllable release and processing parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic and semidefinite programming relaxations in scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with availability constraints to minimize total weighted completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4034337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan / rank
 
Normal rank

Latest revision as of 04:04, 6 July 2024

scientific article
Language Label Description Also known as
English
The symmetric quadratic knapsack problem: approximation and scheduling applications
scientific article

    Statements

    The symmetric quadratic knapsack problem: approximation and scheduling applications (English)
    0 references
    0 references
    0 references
    0 references
    6 February 2013
    0 references
    quadratic knapsack
    0 references
    half-product
    0 references
    single machine scheduling
    0 references
    FPTAS
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references