Currently displaying 1 – 2 of 2

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.

Page 1

Download Results (CSV)