A fully polynomial approximation scheme for weighted-earliness-tardiness problem

Approximation polynomiale et croissance des fonctions N-harmoniques

Djebbar, Bachir

January 1987

SIGLECNRS T Bordereau / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

Réflexion autour de nouvelles notions pour l’analyse des algorithmes d’approximation

Demange, Marc
Paschos, Vangelis

January 2002

The main objective of the polynomial approximation is the development of polynomial time algorithms ...

Weighted tardiness problem.

Rachamadugu, Ram V.

January 1987

http://deepblue.lib.umich.edu/bitstream/2027.42/36006/2/b1408768.0001.001.pdfhttp://deepblue.lib.umi...

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

Kelleler, Hans
Strusevich, Vitaly a.

October 2006

We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total ta...

Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date

Kacem, Imed

May 2010

AbstractThis paper deals with the total weighted tardiness minimization with a common due date on a ...

On an approximation measure founded on the links between optimization and polynomial approximation theory

Demange, M.
Paschos, V.T.
Paris-9 Univ., 75 (France). Lab. d'Analyse et Modelisation de Systemes pour l'Aide a la Decision
Centre National de la Recherche Scientifique (CNRS), 75 - Paris (France). Lab. d'Analyse et Modelisation de Systemes pour l'Aide a la Decision (LAMSADE)

January 1993

Available at INIST (FR), Document Supply Service, under shelf-number : DO 2117 / INIST-CNRS - Instit...

Towards a general formal framework for polynomial approximation (concepts and examples)

Demange, Marc
Paschos, Vangelis T.
Centre National de la Recherche Scientifique, 75 - Paris (France). Unite Mixte de Service de la Maison des Sciences Economiques
Paris-1 Univ., 75 - (France). Centre de Recherches de Mathematiques, Statistiques et d'Economie Mathematique
Paris-1 Univ., 75 - Paris (France). Maison des Sciences Economiques
Centre National de la Recherche Scientifique, 75 - Paris (France). Centre de Recherches de Mathematiques, Statistiques et d'Economie Mathematique

January 2000

SIGLEAvailable from INIST (FR), Document Supply Service, under shelf-number : RP 15762 / INIST-CNRS ...

Towards a general formal framework for polynomial approximation (some constitutive elements of a new problematics)

Demange, Marc
Paschos, Vangelis T.
Centre National de la Recherche Scientifique, 75 - Paris (France). Unite Mixte de Service de la Maison des Sciences Economiques
Paris-1 Univ., 75 - Paris (France). Maison des Sciences Economiques
Paris-1 Univ., 75 - (France). Centre de Recherches de Mathematiques, Statistiques et d'Economie Mathematique
Centre National de la Recherche Scientifique, 75 - Paris (France). Centre de Recherches de Mathematiques, Statistiques et d'Economie Mathematique

January 1999

SIGLEAvailable from INIST (FR), Document Supply Service, under shelf-number : RP 15605 / INIST-CNRS ...

A Pseudo-Polynomial Time Algorithm for Weighted-Tardiness Scheduling with Proportional Weights

Arkin, E.
Roundy, R.

July 1988

A Pseudo-Polynomial Time Algorithm for Weighted-Tardiness Scheduling with Proportional Weight

Algorithms for a class of single-machine weighted tardiness and earliness problems

Yano, Candace Arai
Kim, Yeong-Dae

January 1989

http://deepblue.lib.umich.edu/bitstream/2027.42/8378/5/bam2676.0001.001.pdfhttp://deepblue.lib.umich...

Un algorithme polynomial pour le probleme du voyageur de commerce sur une classe de graphes

Elnachef, Anwar
Fonlupt, Jean
Informatique et Mathematiques Appliquees de Grenoble (IMAG), 38 - Saint-Martin-d'Heres (France). Atelier de Recherches sur les Techniques Mathematiques et Informatiques de Systemes (ARTEMIS)
Grenoble-1 Univ., 38 - Saint-Martin-d'Heres (France). Atelier de Recherches sur les Techniques Mathematiques et Informatiques des Systemes (ARTEMIS)
Institut National Polytechnique de Grenoble (INPG), 38 - Grenoble (France). Atelier de Recherches sur les Techniques Mathematiques et Informatiques des Systemes (ARTEMIS)

January 1986

Available at INIST (FR), Document Supply Service, under shelf-number : 22495, issue : a.1986 n.6 / I...

Approximation algorithms for some combinatorial optimization problems

Paschos, V.T.
Grisoni, P.
Demange, M.
Centre National de la Recherche Scientifique (CNRS), 75 - Paris (France). Lab. d'Analyse et Modelisation de Systemes pour l'Aide a la Decision (LAMSADE)
Paris-9 Univ., 75 (France). Lab. d'Analyse et Modelisation de Systemes pour l'Aide a la Decision

January 1996

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : DO 4346 / INIST-CNRS - I...

Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack

Kellerer, Hans
Strusevich, Vitaly A.

June 2010

We design a fully polynomial-time approximation scheme (FPTAS) for a single machine scheduling probl...

On polynomial solvability of the high multiplicity total weighted tardiness problem

Granot, Frieda
Skorin-Kapov, Jadranka

January 1993

AbstractIn a recent paper Hochbaum developed a polynomial algorithm for solving a scheduling problem...

Weighted H"2 approximation of transfer functions

Leblond, Juliette
Olivi, Martine
Institut National de Recherche en Informatique et en Automatique (INRIA), 06 - Valbonne (France). Unite de Recherche de Sophia-Antipolis

January 1996

Theme 4 - Simulation et optimisation de systemes complexes. Projet MIAOUSIGLEAvailable at INIST (FR)...

Approximation polynomiale et croissance des fonctions N-harmoniques

Djebbar, Bachir

January 1987

SIGLECNRS T Bordereau / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

Réflexion autour de nouvelles notions pour l’analyse des algorithmes d’approximation

Demange, Marc
Paschos, Vangelis

January 2002

The main objective of the polynomial approximation is the development of polynomial time algorithms ...

Weighted tardiness problem.

Rachamadugu, Ram V.

January 1987

http://deepblue.lib.umich.edu/bitstream/2027.42/36006/2/b1408768.0001.001.pdfhttp://deepblue.lib.umi...

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

Kelleler, Hans
Strusevich, Vitaly a.

October 2006

We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total ta...

Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date

Kacem, Imed

May 2010

AbstractThis paper deals with the total weighted tardiness minimization with a common due date on a ...

On an approximation measure founded on the links between optimization and polynomial approximation theory

Demange, M.
Paschos, V.T.
Paris-9 Univ., 75 (France). Lab. d'Analyse et Modelisation de Systemes pour l'Aide a la Decision
Centre National de la Recherche Scientifique (CNRS), 75 - Paris (France). Lab. d'Analyse et Modelisation de Systemes pour l'Aide a la Decision (LAMSADE)

January 1993

Available at INIST (FR), Document Supply Service, under shelf-number : DO 2117 / INIST-CNRS - Instit...

Towards a general formal framework for polynomial approximation (concepts and examples)

Demange, Marc
Paschos, Vangelis T.
Centre National de la Recherche Scientifique, 75 - Paris (France). Unite Mixte de Service de la Maison des Sciences Economiques
Paris-1 Univ., 75 - (France). Centre de Recherches de Mathematiques, Statistiques et d'Economie Mathematique
Paris-1 Univ., 75 - Paris (France). Maison des Sciences Economiques
Centre National de la Recherche Scientifique, 75 - Paris (France). Centre de Recherches de Mathematiques, Statistiques et d'Economie Mathematique

January 2000

SIGLEAvailable from INIST (FR), Document Supply Service, under shelf-number : RP 15762 / INIST-CNRS ...

Towards a general formal framework for polynomial approximation (some constitutive elements of a new problematics)

Demange, Marc
Paschos, Vangelis T.
Centre National de la Recherche Scientifique, 75 - Paris (France). Unite Mixte de Service de la Maison des Sciences Economiques
Paris-1 Univ., 75 - Paris (France). Maison des Sciences Economiques
Paris-1 Univ., 75 - (France). Centre de Recherches de Mathematiques, Statistiques et d'Economie Mathematique
Centre National de la Recherche Scientifique, 75 - Paris (France). Centre de Recherches de Mathematiques, Statistiques et d'Economie Mathematique

January 1999

SIGLEAvailable from INIST (FR), Document Supply Service, under shelf-number : RP 15605 / INIST-CNRS ...

A Pseudo-Polynomial Time Algorithm for Weighted-Tardiness Scheduling with Proportional Weights

Arkin, E.
Roundy, R.

July 1988

A Pseudo-Polynomial Time Algorithm for Weighted-Tardiness Scheduling with Proportional Weight

Algorithms for a class of single-machine weighted tardiness and earliness problems

Yano, Candace Arai
Kim, Yeong-Dae

January 1989

http://deepblue.lib.umich.edu/bitstream/2027.42/8378/5/bam2676.0001.001.pdfhttp://deepblue.lib.umich...

Un algorithme polynomial pour le probleme du voyageur de commerce sur une classe de graphes

Elnachef, Anwar
Fonlupt, Jean
Informatique et Mathematiques Appliquees de Grenoble (IMAG), 38 - Saint-Martin-d'Heres (France). Atelier de Recherches sur les Techniques Mathematiques et Informatiques de Systemes (ARTEMIS)
Grenoble-1 Univ., 38 - Saint-Martin-d'Heres (France). Atelier de Recherches sur les Techniques Mathematiques et Informatiques des Systemes (ARTEMIS)
Institut National Polytechnique de Grenoble (INPG), 38 - Grenoble (France). Atelier de Recherches sur les Techniques Mathematiques et Informatiques des Systemes (ARTEMIS)

January 1986

Available at INIST (FR), Document Supply Service, under shelf-number : 22495, issue : a.1986 n.6 / I...

Approximation algorithms for some combinatorial optimization problems

Paschos, V.T.
Grisoni, P.
Demange, M.
Centre National de la Recherche Scientifique (CNRS), 75 - Paris (France). Lab. d'Analyse et Modelisation de Systemes pour l'Aide a la Decision (LAMSADE)
Paris-9 Univ., 75 (France). Lab. d'Analyse et Modelisation de Systemes pour l'Aide a la Decision

January 1996

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : DO 4346 / INIST-CNRS - I...

Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack

Kellerer, Hans
Strusevich, Vitaly A.

June 2010

We design a fully polynomial-time approximation scheme (FPTAS) for a single machine scheduling probl...

On polynomial solvability of the high multiplicity total weighted tardiness problem

Granot, Frieda
Skorin-Kapov, Jadranka

January 1993

AbstractIn a recent paper Hochbaum developed a polynomial algorithm for solving a scheduling problem...

Weighted H"2 approximation of transfer functions

Leblond, Juliette
Olivi, Martine
Institut National de Recherche en Informatique et en Automatique (INRIA), 06 - Valbonne (France). Unite de Recherche de Sophia-Antipolis

January 1996

Theme 4 - Simulation et optimisation de systemes complexes. Projet MIAOUSIGLEAvailable at INIST (FR)...

Approximation polynomiale et croissance des fonctions N-harmoniques

Djebbar, Bachir

January 1987

SIGLECNRS T Bordereau / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

Réflexion autour de nouvelles notions pour l’analyse des algorithmes d’approximation

Demange, Marc
Paschos, Vangelis

January 2002

The main objective of the polynomial approximation is the development of polynomial time algorithms ...

Weighted tardiness problem.

Rachamadugu, Ram V.

January 1987

http://deepblue.lib.umich.edu/bitstream/2027.42/36006/2/b1408768.0001.001.pdfhttp://deepblue.lib.umi...

A fully polynomial approximation scheme for weighted-earliness-tardiness problem

Abstract

Extracted data

A fully polynomial approximation scheme for weighted-earliness-tardiness problem

Abstract

Extracted data

Related items

Related items