DocumentCode
3475319
Title
Scheduling for production systems with limited buffers
Author
Liljenvall, Torbjörn
Author_Institution
Control Eng. Lab., Chalmers Univ. of Technol., Goteborg, Sweden
Volume
6
fYear
1999
fDate
1999
Firstpage
469
Abstract
The design of a scheduling algorithm for production systems with limited buffers is presented. The goal is to find near optimal solutions to the problem of minimized makespan. A key problem for systems with limited buffers is the possibility of deadlock. The algorithm presented uses an event-driven approach that guarantees deadlock free solutions. The algorithm is implemented in the C language, and test runs on classical problems and new problems are presented
Keywords
automata theory; optimisation; production control; automata model; event-driven method; job shop; limited buffers; optimisation; production systems; scheduling; Algorithm design and analysis; Automata; Control engineering; Laboratories; Optimal scheduling; Petri nets; Processor scheduling; Production systems; Scheduling algorithm; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on
Conference_Location
Tokyo
ISSN
1062-922X
Print_ISBN
0-7803-5731-0
Type
conf
DOI
10.1109/ICSMC.1999.816597
Filename
816597
Link To Document