Page 1

Displaying 1 – 7 of 7

Showing per page

Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine

M.-L. Levy, P. Lopez, B. Pradin (2010)

RAIRO - Operations Research

We propose a temporal decomposition approach for the one-machine scheduling problem with ready times and due dates. A set of feasible schedules is characterized by means of constraint-based analysis rules. They permit the determination of the feasible locations of each task in a sequence, represented by rank intervals. A decomposition procedure based on comparisons of rank intervals is developed in order to group tasks to be sequenced in the neighbourhood of each other in a feasible solution. Computational...

Distributed fuzzy decision making for production scheduling.

Thomas A. Runkler, Rudolf Sollacher, Wendelin Reverey (2004)

Mathware and Soft Computing

In production systems, input materials (educts) pass through multiple sequential stages until they become a product. The production stages consist of different machines with various dynamic characteristics. The coupling of those machines is a non-linear distributed system. With a distributed control system based on a multi-agent approach, the production system can achieve (almost) maximum output, where lot size and lot sequence are the most important control variables. In most production processes...

Currently displaying 1 – 7 of 7

Page 1