The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Bottlenecks in serial production lines: A system-theoretic approach.”

On minimizing total tardiness in a serial batching problem

Philippe Baptiste, Antoine Jouglet (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

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.

Timed Petri-net based formulation and an algorithm for the optimal scheduling of batch plants

Tianlong Gu, Parisa Bahri, Guoyong Cai (2003)

International Journal of Applied Mathematics and Computer Science

Similarity:

The effective scheduling of operations in batch plants has a great potential for high economic returns, in which the formulation and an optimal solution algorithm are the main issues of study. Petri nets have proven to be a promising technique for solving many difficult problems associated with the modelling, formal analysis, design and coordination control of discrete-event systems. One of the major advantages of using a Petri-net model is that the same model can be used for the analysis...

Differential geometry of grassmannians and the Plücker map

Sasha Anan’in, Carlos Grossi (2012)

Open Mathematics

Similarity:

Using the Plücker map between grassmannians, we study basic aspects of classic grassmannian geometries. For ‘hyperbolic’ grassmannian geometries, we prove some facts (for instance, that the Plücker map is a minimal isometric embedding) that were previously known in the ‘elliptic’ case.