DocumentCode
2571685
Title
A scheduling framework based on Petri net modeling and sequential Lagrangian relaxation approach
Author
Chen, Haoxun ; Proth, Jean-marie ; Hu, Baosheng
Author_Institution
CESCOM, Inst. Nat. de Recherche en Inf. et Autom., Lorraine, France
fYear
1994
fDate
10-12 Oct 1994
Firstpage
272
Lastpage
278
Abstract
Job shop scheduling problems with weighted quadratic tardiness costs are formulated as a class of transition firing problems of timed Petri nets, and a sequential Lagrangian relaxation approach is proposed to solve the scheduling problems. It is shown that the approach can not only avoid the solution oscillation in the Lagrangian relaxation approach proposed by Hoitomt and Luh, but also generate good near-optimal schedules
Keywords
Petri nets; optimisation; production control; relaxation theory; Petri net modeling; near-optimal schedules; scheduling framework; sequential Lagrangian relaxation approach; timed Petri nets; transition firing problems; weighted quadratic tardiness costs; Costs; Job shop scheduling; Lagrangian functions; Manufacturing systems; Optimal scheduling; Optimization methods; Petri nets; Polynomials; Processor scheduling; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Integrated Manufacturing and Automation Technology, 1994., Proceedings of the Fourth International Conference on
Conference_Location
Troy, NY
Print_ISBN
0-8186-6510-6
Type
conf
DOI
10.1109/CIMAT.1994.389061
Filename
389061
Link To Document