Scheduling of piecewise constant product flows: A Petri net approach

Scheduling of piecewise constant product flows: A Petri net approach

0.00 Avg rating0 Votes
Article ID: iaor19992315
Country: Netherlands
Volume: 106
Issue: 1
Start Page Number: 45
End Page Number: 56
Publication Date: Apr 1998
Journal: European Journal of Operational Research
Authors: ,
Keywords: production: FMS
Abstract:

Scheduling a manufacturing system is usually an NP-hard problem. This means that only heuristic algorithms can be used to provide near-optimal schedules. In this paper, we show that a manufacturing system can be modeled using a particular type of Petri nets, called Controllable-Output nets, or CO nets for short. These Petri net models are then used to introduce a two-stage scheduling algorithm for problems in which the product flows can be considered as piecewise constant. The first stage consists of distributing the workload among the resources. The second stage derives a schedule from the resource workload. The deterministic case is considered. Numerical results are proposed.

Reviews

Required fields are marked *. Your email address will not be published.