European Journal of Operational Research, ISSN 0377-2217, 02/2020, Volume 281, Issue 1, pp. 16 - 24

•Any instance can be reduced to a restricted-type instance.•A feasible strongly structured schedule is close to a feasible schedule.•A linear program can be...

Scheduling | Parallel two-stage flow-shops | Makespan | Mixed integer program | Polynomial-time approximation scheme | MACHINES | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | HYBRID FLOWSHOP | ALGORITHMS | HEURISTICS

Scheduling | Parallel two-stage flow-shops | Makespan | Mixed integer program | Polynomial-time approximation scheme | MACHINES | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | HYBRID FLOWSHOP | ALGORITHMS | HEURISTICS

Journal Article

Annals of Operations Research, ISSN 0254-5330, 8/2019, Volume 279, Issue 1, pp. 367 - 386

Stimulated by salient applications arising from power systems, this paper studies a class of non-linear Knapsack problems with non-separable quadratic...

Business and Management | Operations Research/Decision Theory | Theory of Computation | Power generation planning | Economic dispatch control | Combinatorics | Quasi polynomial-time approximation scheme | Weighted Minimization Knapsack | Polynomial-time approximation scheme | Smart grid | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHMS | Nonlinear theories | Approximation theory | Research | Mathematical research | Greedy algorithms | Problems | Approximation | Computer simulation | Linear programming | Polynomials | Boolean algebra | Optimization | Knapsack problem

Business and Management | Operations Research/Decision Theory | Theory of Computation | Power generation planning | Economic dispatch control | Combinatorics | Quasi polynomial-time approximation scheme | Weighted Minimization Knapsack | Polynomial-time approximation scheme | Smart grid | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHMS | Nonlinear theories | Approximation theory | Research | Mathematical research | Greedy algorithms | Problems | Approximation | Computer simulation | Linear programming | Polynomials | Boolean algebra | Optimization | Knapsack problem

Journal Article

SIAM Journal on Computing, ISSN 0097-5397, 2005, Volume 35, Issue 3, pp. 713 - 728

The multiple knapsack problem (MKP) is a natural and well-known generalization of the single knapsack problem and is defined as follows. We are given a set of...

Polynomial time approximation scheme | Generalized assignment problem | Multiple knapsack problem | Approximation algorithm | multiple knapsack problem | MATHEMATICS, APPLIED | polynomial time approximation scheme | BIN PACKING | approximation algorithm | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | generalized assignment problem

Polynomial time approximation scheme | Generalized assignment problem | Multiple knapsack problem | Approximation algorithm | multiple knapsack problem | MATHEMATICS, APPLIED | polynomial time approximation scheme | BIN PACKING | approximation algorithm | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | generalized assignment problem

Journal Article

Journal of the ACM (JACM), ISSN 0004-5411, 03/2018, Volume 65, Issue 2, pp. 1 - 44

Two of the most widely used approaches to obtain polynomial-time approximation schemes (PTASs) on planar graphs are the Lipton-Tarjan separator-based approach...

unit disk graph | parameterized complexity | bidimensionality | embedded graph | monadic second-order logic | Polynomial-time approximation scheme | treewidth | Embedded graph | Bidimensionality | Monadic second-order logic | Parameterized complexity | Unit disk graph | Treewidth | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | Theory | UNIT DISK GRAPHS | COMPUTER SCIENCE, INFORMATION SYSTEMS | TREE-WIDTH | MAP GRAPHS | Design | DOMINATING SET | COMPUTER SCIENCE, SOFTWARE ENGINEERING | UPPER-BOUNDS | Algorithms | SEPARATOR THEOREM | FAMILIES | SUBEXPONENTIAL PARAMETERIZED ALGORITHMS | PLANAR GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | HARD PROBLEMS

unit disk graph | parameterized complexity | bidimensionality | embedded graph | monadic second-order logic | Polynomial-time approximation scheme | treewidth | Embedded graph | Bidimensionality | Monadic second-order logic | Parameterized complexity | Unit disk graph | Treewidth | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | Theory | UNIT DISK GRAPHS | COMPUTER SCIENCE, INFORMATION SYSTEMS | TREE-WIDTH | MAP GRAPHS | Design | DOMINATING SET | COMPUTER SCIENCE, SOFTWARE ENGINEERING | UPPER-BOUNDS | Algorithms | SEPARATOR THEOREM | FAMILIES | SUBEXPONENTIAL PARAMETERIZED ALGORITHMS | PLANAR GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | HARD PROBLEMS

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 05/2018, Volume 725, pp. 64 - 78

We study approximation algorithms for the following geometric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. Let D...

Polynomial-time approximation scheme | Maximum coverage | Geometric set cover | PLACEMENT | SETS | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | RECTANGLES | Computer science | Algorithms

Polynomial-time approximation scheme | Maximum coverage | Geometric set cover | PLACEMENT | SETS | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | RECTANGLES | Computer science | Algorithms

Journal Article

Naval Research Logistics (NRL), ISSN 0894-069X, 03/2016, Volume 63, Issue 2, pp. 172 - 183

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed...

scheduling | late work | fully polynomial‐time approximation scheme | fully polynomial-time approximation scheme | Algorithms | Approximation | Mathematical analysis | Naval | Scheduling | Maintenance | Optimization | Logistics

scheduling | late work | fully polynomial‐time approximation scheme | fully polynomial-time approximation scheme | Algorithms | Approximation | Mathematical analysis | Naval | Scheduling | Maintenance | Optimization | Logistics

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 07/2018, Volume 734, pp. 24 - 31

In the parallel k-stage flow-shops problem, we are given m identical k-stage flow-shops and a set of jobs. Each job can be processed by any one of the...

Multiprocessor scheduling | Makespan | Flow-shop scheduling | Polynomial-time approximation scheme | Linear program | 2-STAGE FLOWSHOP | STAGE | ALGORITHMS | HEURISTICS | SCHEDULING PROBLEM | MACHINES | COMPLEXITY | HYBRID FLOWSHOP | COMPUTER SCIENCE, THEORY & METHODS

Multiprocessor scheduling | Makespan | Flow-shop scheduling | Polynomial-time approximation scheme | Linear program | 2-STAGE FLOWSHOP | STAGE | ALGORITHMS | HEURISTICS | SCHEDULING PROBLEM | MACHINES | COMPLEXITY | HYBRID FLOWSHOP | COMPUTER SCIENCE, THEORY & METHODS

Journal Article

Engineering Optimization, ISSN 0305-215X, 11/2019, Volume 51, Issue 11, pp. 1938 - 1943

This article considers a single machine scheduling problem in which the processing time of a job is a linear increasing function of its starting time. The...

deteriorating jobs | Scheduling | single machine | fully polynomial-time approximation scheme | Algorithms | Approximation | Mathematical analysis | Production scheduling | Polynomials | Dynamic programming

deteriorating jobs | Scheduling | single machine | fully polynomial-time approximation scheme | Algorithms | Approximation | Mathematical analysis | Production scheduling | Polynomials | Dynamic programming

Journal Article

Algorithmica, ISSN 0178-4617, 9/2019, Volume 81, Issue 9, pp. 3725 - 3745

We study classical deadline-based preemptive scheduling of jobs in a computing environment equipped with both dynamic speed scaling and sleep state...

Computer Systems Organization and Communication Networks | Algorithms | Mathematics of Computing | Computer Science | Approximation algorithms | Theory of Computation | Energy efficiency | Algorithm Analysis and Problem Complexity | Polynomial-time approximation scheme | Data Structures and Information Theory | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | ENERGY | POWER | Energy consumption | Sleep | Hardness | Energy conservation | Data Structures and Algorithms | Computational Geometry

Computer Systems Organization and Communication Networks | Algorithms | Mathematics of Computing | Computer Science | Approximation algorithms | Theory of Computation | Energy efficiency | Algorithm Analysis and Problem Complexity | Polynomial-time approximation scheme | Data Structures and Information Theory | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | ENERGY | POWER | Energy consumption | Sleep | Hardness | Energy conservation | Data Structures and Algorithms | Computational Geometry

Journal Article

Networks, ISSN 0028-3045, 12/2003, Volume 42, Issue 4, pp. 202 - 208

A connected dominating set in a graph is a subset of vertices such that every vertex is either in the subset or adjacent to a vertex in the subset and the...

unit disk graph | partition | polynomial‐time approximation scheme | connected dominating set | Partition | Connected dominating set | Polynomial-time approximation scheme | Unit disk graph | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | polynomial-time approximation scheme | UNIT DISK GRAPHS

unit disk graph | partition | polynomial‐time approximation scheme | connected dominating set | Partition | Connected dominating set | Polynomial-time approximation scheme | Unit disk graph | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | polynomial-time approximation scheme | UNIT DISK GRAPHS

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 01/2013, Volume 468, pp. 114 - 121

Two models of two-agent scheduling problem on identical machines are considered in this paper. In both models, the goal is to minimize the makespan and the...

Parallel machines | Fully polynomial time approximation scheme | Dynamic programming | Algorithm | Agent scheduling | SINGLE-MACHINE | COMPUTER SCIENCE, THEORY & METHODS

Parallel machines | Fully polynomial time approximation scheme | Dynamic programming | Algorithm | Agent scheduling | SINGLE-MACHINE | COMPUTER SCIENCE, THEORY & METHODS

Journal Article

Journal of Global Optimization, ISSN 0925-5001, 8/2017, Volume 68, Issue 4, pp. 749 - 775

The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals $$\left\{ [a_{i,1},a_{i,2}]\right\}...

68Q25 | Solution structure | Fully polynomial time approximation scheme | Mathematics | 90C59 | Operation Research/Decision Theory | Computer Science, general | Interval subset sum problem | Computational complexity | Optimization | Real Functions | Worst-case performance | KNAPSACK-PROBLEMS | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHMS | Numerical analysis | Integers | Approximation | Computer simulation | Mathematical analysis | Production scheduling | Complexity | Knapsack problem

68Q25 | Solution structure | Fully polynomial time approximation scheme | Mathematics | 90C59 | Operation Research/Decision Theory | Computer Science, general | Interval subset sum problem | Computational complexity | Optimization | Real Functions | Worst-case performance | KNAPSACK-PROBLEMS | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHMS | Numerical analysis | Integers | Approximation | Computer simulation | Mathematical analysis | Production scheduling | Complexity | Knapsack problem

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 2/2019, Volume 37, Issue 2, pp. 668 - 684

A two-stage openshop consists of a machine in the first stage and a machine in the second stage; a job processed on the two-stage openshop means it is...

Fully polynomial-time approximation scheme | Convex and Discrete Geometry | Operations Research/Decision Theory | Two-stage openshop | Mathematics | Theory of Computation | Scheduling | Makespan | Mathematical Modeling and Industrial Mathematics | Dynamic programming | Combinatorics | Optimization | MATHEMATICS, APPLIED | MULTIPROCESSOR FLOW-SHOP | ALGORITHMS | HEURISTICS | MACHINES | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | COMPLEXITY | HYBRID FLOWSHOP | MINIMIZE | Machinery | Magneto-electric machines | Algorithms

Fully polynomial-time approximation scheme | Convex and Discrete Geometry | Operations Research/Decision Theory | Two-stage openshop | Mathematics | Theory of Computation | Scheduling | Makespan | Mathematical Modeling and Industrial Mathematics | Dynamic programming | Combinatorics | Optimization | MATHEMATICS, APPLIED | MULTIPROCESSOR FLOW-SHOP | ALGORITHMS | HEURISTICS | MACHINES | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | COMPLEXITY | HYBRID FLOWSHOP | MINIMIZE | Machinery | Magneto-electric machines | Algorithms

Journal Article

Theory of Computing Systems, ISSN 1432-4350, 8/2016, Volume 59, Issue 2, pp. 262 - 322

The Variable-Sized Bin Packing Problem (abbreviated as VSBPP or VBP) is a well-known generalization of the NP-hard Bin Packing Problem (BP) where the items can...

Computational Mathematics and Numerical Analysis | Knapsack problem with inversely proportional profits | Fully polynomial time approximation scheme (FPTAS) | Computer Science | Bin packing | Variable-sized bin packing | Asymptotic fully polynomial time approximation scheme (AFPTAS) | Theory of Computation | Knapsack problem | MATHEMATICS | LINEAR-PROGRAMMING APPROACH | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | KNAPSACK | Computer science | Algorithms | Variables | Studies | Packing problem | Mathematical analysis | Approximations | Polynomials | Asymptotic methods | Additives | Approximation | Asymptotic properties | Run time (computers) | Texts

Computational Mathematics and Numerical Analysis | Knapsack problem with inversely proportional profits | Fully polynomial time approximation scheme (FPTAS) | Computer Science | Bin packing | Variable-sized bin packing | Asymptotic fully polynomial time approximation scheme (AFPTAS) | Theory of Computation | Knapsack problem | MATHEMATICS | LINEAR-PROGRAMMING APPROACH | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | KNAPSACK | Computer science | Algorithms | Variables | Studies | Packing problem | Mathematical analysis | Approximations | Polynomials | Asymptotic methods | Additives | Approximation | Asymptotic properties | Run time (computers) | Texts

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 01/2020, Volume 803, pp. 57 - 70

A mixed shop is a manufacturing infrastructure designed to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general...

Proportionate | Fully polynomial-time approximation scheme | Scheduling | Mixed shop | Approximation algorithm | COMPUTER SCIENCE, THEORY & METHODS

Proportionate | Fully polynomial-time approximation scheme | Scheduling | Mixed shop | Approximation algorithm | COMPUTER SCIENCE, THEORY & METHODS

Journal Article

Proceedings of the Steklov Institute of Mathematics, ISSN 0081-5438, 12/2017, Volume 299, Issue S1, pp. 97 - 105

The Generalized Traveling Salesman Problem (GTSP) is defined by a weighted graph G = (V,E,w) and a partition of its vertex set into k disjoint clusters V = V 1...

Mathematics, general | Mathematics | NP-hard problem | polynomial-time approximation scheme | generalized traveling salesman problem | MATHEMATICS | MATHEMATICS, APPLIED | ALGORITHMS

Mathematics, general | Mathematics | NP-hard problem | polynomial-time approximation scheme | generalized traveling salesman problem | MATHEMATICS | MATHEMATICS, APPLIED | ALGORITHMS

Journal Article

Journal of Optimization Theory and Applications, ISSN 0022-3239, 9/2017, Volume 174, Issue 3, pp. 927 - 944

We study the scheduling problem with a common due date on two parallel identical machines and the total early work criterion. The problem is known to be...

68Q25 | Late work | Parallel machines | Polynomial time approximation scheme | Mathematics | Theory of Computation | Scheduling | Optimization | Calculus of Variations and Optimal Control; Optimization | Operations Research/Decision Theory | 90B35 | Applications of Mathematics | Engineering, general | Early work | MATHEMATICS, APPLIED | SINGLE-MACHINE | ALGORITHMS | WEIGHTED LATE WORK | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | PROCESSORS | MINIMIZE | CRITERION | 2-MACHINE FLOW-SHOP | Machinery | Magneto-electric machines | Algorithms | Functions (mathematics) | Approximation | Computation | Production scheduling | Polynomials | Dynamic programming | Criteria

68Q25 | Late work | Parallel machines | Polynomial time approximation scheme | Mathematics | Theory of Computation | Scheduling | Optimization | Calculus of Variations and Optimal Control; Optimization | Operations Research/Decision Theory | 90B35 | Applications of Mathematics | Engineering, general | Early work | MATHEMATICS, APPLIED | SINGLE-MACHINE | ALGORITHMS | WEIGHTED LATE WORK | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | PROCESSORS | MINIMIZE | CRITERION | 2-MACHINE FLOW-SHOP | Machinery | Magneto-electric machines | Algorithms | Functions (mathematics) | Approximation | Computation | Production scheduling | Polynomials | Dynamic programming | Criteria

Journal Article

SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2014, Volume 28, Issue 4, pp. 1725 - 1796

We present a framework for obtaining fully polynomial time approximation schemes (FPTASs) for stochastic univariate dynamic programs with either convex or...

Stochastic dynamic programming | K-approximation | Fully polynomial time approximation schemes | CAPACITY | MATHEMATICS, APPLIED | ALGORITHMS | stochastic dynamic programming | KNAPSACK-PROBLEM | POLICIES | DEMAND | COST | fully polynomial time approximation schemes | INVENTORY CONTROL | FPTAS | PREFERENCE | Approximation | Computation | Dynamics | Mathematical analysis | Mathematical models | Calculus | Polynomials | Stochasticity

Stochastic dynamic programming | K-approximation | Fully polynomial time approximation schemes | CAPACITY | MATHEMATICS, APPLIED | ALGORITHMS | stochastic dynamic programming | KNAPSACK-PROBLEM | POLICIES | DEMAND | COST | fully polynomial time approximation schemes | INVENTORY CONTROL | FPTAS | PREFERENCE | Approximation | Computation | Dynamics | Mathematical analysis | Mathematical models | Calculus | Polynomials | Stochasticity

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 217, pp. 71 - 78

We address the problem of minimizing a half-product function, with and without a linear knapsack constraint. We show how to convert known fully polynomial-time...

Quadratic knapsack | FPTAS | Half-product | Differential approximation schemes | MATHEMATICS, APPLIED | SINGLE-MACHINE | ALGORITHM | MINIMIZING SUBMODULAR FUNCTIONS | WEIGHTED COMPLETION-TIME | POLYNOMIAL-TIME | MINIMIZATION | NON-AVAILABILITY INTERVAL | QUADRATIC KNAPSACK-PROBLEM | OPTIMIZATION

Quadratic knapsack | FPTAS | Half-product | Differential approximation schemes | MATHEMATICS, APPLIED | SINGLE-MACHINE | ALGORITHM | MINIMIZING SUBMODULAR FUNCTIONS | WEIGHTED COMPLETION-TIME | POLYNOMIAL-TIME | MINIMIZATION | NON-AVAILABILITY INTERVAL | QUADRATIC KNAPSACK-PROBLEM | OPTIMIZATION

Journal Article

SIAM Journal on Computing, ISSN 0097-5397, 2012, Volume 41, Issue 3, pp. 684 - 713

We give a polynomial-time approximation scheme for the generalization of Huffman coding in which codeword letters have nonuniform costs (as in Morse code,...

Polynomial-time approximation scheme | Huffman coding with letter costs | MATHEMATICS, APPLIED | UNEQUAL LETTER COSTS | polynomial-time approximation scheme | EQUIPROBABLE WORDS | CHANNEL | PREFIX-FREE CODES | ALGORITHM | COMPUTER SCIENCE, THEORY & METHODS | NOISELESS | Computer Science - Data Structures and Algorithms

Polynomial-time approximation scheme | Huffman coding with letter costs | MATHEMATICS, APPLIED | UNEQUAL LETTER COSTS | polynomial-time approximation scheme | EQUIPROBABLE WORDS | CHANNEL | PREFIX-FREE CODES | ALGORITHM | COMPUTER SCIENCE, THEORY & METHODS | NOISELESS | Computer Science - Data Structures and Algorithms

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.