Currently displaying 1 – 6 of 6

Showing per page

Order by Relevance | Title | Year of publication

On minimizing total tardiness in a serial batching problem

Philippe BaptisteAntoine Jouglet — 2001

RAIRO - Operations Research - Recherche Opérationnelle

We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. This problem 1 | s-batch | T i is known to be NP-Hard in the ordinary sense. In this paper we show that it is solvable in pseudopolynomial time by dynamic programming.

On Minimizing Total Tardiness in a Serial Batching Problem

Philippe BaptisteAntoine Jouglet — 2010

RAIRO - Operations Research

We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time occurs. This problem | ∑ is known to be NP-Hard in the ordinary sense. In this paper we show that it is solvable in pseudopolynomial time by dynamic programming.

Airspace sectorization with constraints

Huy TrandacPhilippe BaptisteVu Duong — 2005

RAIRO - Operations Research - Recherche Opérationnelle

We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related constraints are taken into account. The problem is solved in a constraint programming framework. Experimental...

Airspace sectorization with constraints

Huy TrandacPhilippe BaptisteVu Duong — 2010

RAIRO - Operations Research

We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related constraints are taken into account. The problem is solved in a constraint programming framework. Experimental...

Page 1

Download Results (CSV)