DocumentCode
2556118
Title
Model of job shop scheduling based on graph theory and combination of machines
Author
Wang, Feng ; Lin, Jie ; Liu, Xiao-hua
Author_Institution
Sch. of Econ. & Manage., Tongji Univ., Shanghai
fYear
2008
fDate
2-4 July 2008
Firstpage
1056
Lastpage
1060
Abstract
The paper gives up some hypotheses of the job shop scheduling problem. Firstly, the operations of the jobs are planed following the priority of the jobs. Secondly, one operation of the job can be done by the combination of machines not only by one machine. Finally, a model based on the graph theory is introduced, an algorithm based on the greedy algorithm is proposed and a case study was used to illustrate the feasibility and effectiveness of the proposed method. Model of job shop scheduling based on graph theory and combination of machines.
Keywords
graph theory; greedy algorithms; job shop scheduling; production equipment; graph theory; greedy algorithm; job shop scheduling; machine combination; Graph theory; Job shop scheduling; Production; Job Shop Scheduling; combination of machines; graph theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference, 2008. CCDC 2008. Chinese
Conference_Location
Yantai, Shandong
Print_ISBN
978-1-4244-1733-9
Electronic_ISBN
978-1-4244-1734-6
Type
conf
DOI
10.1109/CCDC.2008.4597474
Filename
4597474
Link To Document