International Journal of Production Research · 2003 · 15 citations · 0 references
Petri NetEngineeringIndustrial EngineeringLocal ApproachOperations ResearchGeneral Scheduling ProblemSystems EngineeringCombinatorial OptimizationDedicated CyclicStochastic Petri NetComputer EngineeringFlexible ManufacturingManufacturing SystemsComputer SciencePetri NetsFlexible Manufacturing SystemInteger ProgrammingScheduling AnalysisIndustrial DesignScheduling ProblemAutomationProduction SchedulingScheduling (Production Processes)Real-time SystemsIndustrial InformaticsResource Optimization
We are interested in the Flexible Manufacturing System (FMS) scheduling problem. Different methods have been explored to solve this problem and to master its combinatorial complexity, which is NP-hard in the general case. In this paper we will give two different scheduling methods based on Petri nets. The first one tends to solve the general scheduling problem (acyclic schedule) using the Constraint Programming method to avoid exhaustive search. The second method is a dedicated cyclic scheduling method. The aim is not to compare the methods' performances (computation time, results' quality) because they do not solve exactly the same problem, but to compare their application domains in terms of parts number.