The two-stage assembly scheduling problem : complexity and approximation

Integrated Scheduling, Assembly Area- and Part-Assignment for Large Scale, Make-to-Order Assemblies

R. Kolisch

January 1998

The problem of scheduling multiple, large scale, make--to--order assemblies is considered. Beside &q...

Resource-constrained scheduling of partitioned algorithms on processor arrays

Dion, Michele
Risset, Tanguy
Robert, Yves
Lyon-1 Univ., 69 (France). Lab. de l'Informatique du Parallelisme
Institut Informatique et Mathematiques Appliquees de Grenoble (IMAG), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme
Ecole Normale Superieure de Lyon, 69 (France). Lab. de l'Informatique du Parallelisme
Centre National de la Recherche Scientifique (CNRS), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme

January 1994

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

Herrmann, Jeffrey
Proth, Jean-Marie
Sauer, Nathalie
Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Villers-les-Nancy (France). Unite de Recherche de Lorraine

January 1996

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1996 ...

On-line scheduling in assembly processes

Chauvet, Fabrice
Proth, Jean-Marie
Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Villers-les-Nancy (France). Unite de Recherche de Lorraine

January 1998

Theme 4 - Simulation et optimisation de systemes complexes.SIGLEAvailable from INIST (FR), Document ...

New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation

Talens Fayos, Carla
Pérez González, Paz
Fernández-Viagas Escudero, Víctor
Framiñán Torres, José Manuel

September 2024

Acceso embargado a la versión aceptada de 36 meses - Requerimientos del editor Elsevier https://v2.s...

Single machine scheduling with set-ups to minimize the number of late items : algorithms, complexity and approximation

Kovalyov, M.Y.
Potts, C.N.
Van Wassenhove, L.N.
Institut Europeen d'Administration des Affaires (INSEAD), 77 - Fontainebleau (France)

January 1993

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

Time and information problems in overlapping development activities

Terwiesch, Christian
Institut Europeen d'Administration des Affaires (INSEAD), 77 - Fontainebleau (France)

January 1995

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

Approximation algorithms for scheduling a single machine to minimize total late work

Potts, C.N.
Van Wassenhove, Luk
Institut Europeen d'Administration des Affaires (INSEAD), 77 - Fontainebleau (France)

January 1991

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

A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes

Boctor, Fayez F.
Universite de Paris 1 Pantheon-Sorbonne, 75 - Paris (France). Groupe de Recherche en Gestion des Organisations (GREGOR)

January 1994

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

Branch and bound algorithms for single machine scheduling with batch set-up times to minimize total weighted completion time

Crauwels, H.A.J.
Hariri, A.M.A.
Potts, C.N.
Van Wassenhove, L.N.
Institut Europeen d'Administration des Affaires (INSEAD), 77 - Fontainebleau (France)

January 1995

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

Scheduling uniform loop nests

Darte, Alain
Robert, Yves
Ecole Normale Superieure de Lyon, 69 (France). Lab. de l'Informatique du Parallelisme
Centre National de la Recherche Scientifique (CNRS), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme
Institut Informatique et Mathematiques Appliquees de Grenoble (IMAG), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme

January 1992

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

Single machine scheduling subject to precedence delays

Finta, Lucian
Liu, Zhen
Institut National de Recherche en Informatique et en Automatique (INRIA), 06 - Valbonne (France). Unite de Recherche de Sophia-Antipolis

January 1994

Programme 1 : architectures paralleles, bases de donnees, reseaux et systemes distribuesAvailable at...

A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

Tozkapan, A
Kirca, O
Chung, CS

February 2003

In this paper, a two-stage assembly scheduling problem is considered with the objective of minimizin...

Batching decisions for assembly production systems

Kovalyov, M.Y.
Potts, C.N.
Strusevich, V.A.

January 2003

The two-stage assembly scheduling problem is a model for production processes that involve the assem...

Two-steps combinatorial optimization

Paschos, Vangelis T.
Demange, Marc
Centre National de la Recherche Scientifique, 75 - Paris (France). Unite Mixte de Service de la Maison des Sciences Economiques
Centre National de la Recherche Scientifique, 75 - Paris (France). Centre de Recherches de Mathematiques, Statistiques et d'Economie Mathematique
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

January 2001

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

Integrated Scheduling, Assembly Area- and Part-Assignment for Large Scale, Make-to-Order Assemblies

R. Kolisch

January 1998

The problem of scheduling multiple, large scale, make--to--order assemblies is considered. Beside &q...

Resource-constrained scheduling of partitioned algorithms on processor arrays

Dion, Michele
Risset, Tanguy
Robert, Yves
Lyon-1 Univ., 69 (France). Lab. de l'Informatique du Parallelisme
Institut Informatique et Mathematiques Appliquees de Grenoble (IMAG), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme
Ecole Normale Superieure de Lyon, 69 (France). Lab. de l'Informatique du Parallelisme
Centre National de la Recherche Scientifique (CNRS), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme

January 1994

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

Herrmann, Jeffrey
Proth, Jean-Marie
Sauer, Nathalie
Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Villers-les-Nancy (France). Unite de Recherche de Lorraine

January 1996

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1996 ...

On-line scheduling in assembly processes

Chauvet, Fabrice
Proth, Jean-Marie
Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Villers-les-Nancy (France). Unite de Recherche de Lorraine

January 1998

Theme 4 - Simulation et optimisation de systemes complexes.SIGLEAvailable from INIST (FR), Document ...

New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation

Talens Fayos, Carla
Pérez González, Paz
Fernández-Viagas Escudero, Víctor
Framiñán Torres, José Manuel

September 2024

Acceso embargado a la versión aceptada de 36 meses - Requerimientos del editor Elsevier https://v2.s...

Single machine scheduling with set-ups to minimize the number of late items : algorithms, complexity and approximation

Kovalyov, M.Y.
Potts, C.N.
Van Wassenhove, L.N.
Institut Europeen d'Administration des Affaires (INSEAD), 77 - Fontainebleau (France)

January 1993

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

Time and information problems in overlapping development activities

Terwiesch, Christian
Institut Europeen d'Administration des Affaires (INSEAD), 77 - Fontainebleau (France)

January 1995

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

Approximation algorithms for scheduling a single machine to minimize total late work

Potts, C.N.
Van Wassenhove, Luk
Institut Europeen d'Administration des Affaires (INSEAD), 77 - Fontainebleau (France)

January 1991

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

A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes

Boctor, Fayez F.
Universite de Paris 1 Pantheon-Sorbonne, 75 - Paris (France). Groupe de Recherche en Gestion des Organisations (GREGOR)

January 1994

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

Branch and bound algorithms for single machine scheduling with batch set-up times to minimize total weighted completion time

Crauwels, H.A.J.
Hariri, A.M.A.
Potts, C.N.
Van Wassenhove, L.N.
Institut Europeen d'Administration des Affaires (INSEAD), 77 - Fontainebleau (France)

January 1995

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

Scheduling uniform loop nests

Darte, Alain
Robert, Yves
Ecole Normale Superieure de Lyon, 69 (France). Lab. de l'Informatique du Parallelisme
Centre National de la Recherche Scientifique (CNRS), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme
Institut Informatique et Mathematiques Appliquees de Grenoble (IMAG), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme

January 1992

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

Single machine scheduling subject to precedence delays

Finta, Lucian
Liu, Zhen
Institut National de Recherche en Informatique et en Automatique (INRIA), 06 - Valbonne (France). Unite de Recherche de Sophia-Antipolis

January 1994

Programme 1 : architectures paralleles, bases de donnees, reseaux et systemes distribuesAvailable at...

A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

Tozkapan, A
Kirca, O
Chung, CS

February 2003

In this paper, a two-stage assembly scheduling problem is considered with the objective of minimizin...

Batching decisions for assembly production systems

Kovalyov, M.Y.
Potts, C.N.
Strusevich, V.A.

January 2003

The two-stage assembly scheduling problem is a model for production processes that involve the assem...

Two-steps combinatorial optimization

Paschos, Vangelis T.
Demange, Marc
Centre National de la Recherche Scientifique, 75 - Paris (France). Unite Mixte de Service de la Maison des Sciences Economiques
Centre National de la Recherche Scientifique, 75 - Paris (France). Centre de Recherches de Mathematiques, Statistiques et d'Economie Mathematique
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

January 2001

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

Integrated Scheduling, Assembly Area- and Part-Assignment for Large Scale, Make-to-Order Assemblies

R. Kolisch

January 1998

The problem of scheduling multiple, large scale, make--to--order assemblies is considered. Beside &q...

Resource-constrained scheduling of partitioned algorithms on processor arrays

Dion, Michele
Risset, Tanguy
Robert, Yves
Lyon-1 Univ., 69 (France). Lab. de l'Informatique du Parallelisme
Institut Informatique et Mathematiques Appliquees de Grenoble (IMAG), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme
Ecole Normale Superieure de Lyon, 69 (France). Lab. de l'Informatique du Parallelisme
Centre National de la Recherche Scientifique (CNRS), 69 - Lyon (France). Lab. de l'Informatique du Parallelisme

January 1994

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

Herrmann, Jeffrey
Proth, Jean-Marie
Sauer, Nathalie
Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Villers-les-Nancy (France). Unite de Recherche de Lorraine

January 1996

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1996 ...

The two-stage assembly scheduling problem : complexity and approximation

Abstract

Extracted data

The two-stage assembly scheduling problem : complexity and approximation

Abstract

Extracted data

Related items

Related items