Production planning by shuffle operation

Authors:
Adalbert Golomety;Alina Pitic;Iulia Golomety;Antoniu Pitic
Affiliations:
Department of Computer Science, Hermman Oberth Faculty of Engineering, Lucian Blaga University of Sibiu, Sibiu, Romania;Department of Computer Science, Hermman Oberth Faculty of Engineering, Lucian Blaga University of Sibiu, Sibiu, Romania;Department of Computer Science, Hermman Oberth Faculty of Engineering, Lucian Blaga University of Sibiu, Sibiu, Romania;Department of Computer Science, Hermman Oberth Faculty of Engineering, Lucian Blaga University of Sibiu, Sibiu, Romania
Venue:
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Year:
2007

Citing 1
Cited 1

Shuffle languages, Petri nets, and context-sensitive grammars

Communications of the ACM

Shuffle from sequential to parallel in production planning

WSEAS Transactions on Computer Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an implementation of shuffle operation in production planning. We present a computational formula for shuffle and some optimizations to reduce the sets of shuffle strings. Our idea is to combine shuffle with parallelism for a planning of production phases.