Scheduling job shop problem is searching for good schedule or optimization with the goal of finding the best schedule. The main objective of this paper is to develop some heuristic rules for job shop scheduling problem. These heuristic rules are developed and tested in their scheduling performances with other common rules in benchmark problems. Six measures are considered for performance evaluation. Seventy instance cases are used as jobs for scheduling process. The results are compared with eighteen common heuristic rules for the considered test cases. The proposed heuristics are found to be promising in their effectiveness in scheduling job shop problem. A computer program could be designed to test the validity of the proposed heuristics.
Boushaala,, A. A., & Esheem,, S. (2013). SOME HEURISTIC RULES FOR JOB SHOP SCHEDULING PROBLEM. ERJ. Engineering Research Journal, 36(2), 167-174. doi: 10.21608/erjm.2013.67066
MLA
A. A Boushaala,; S Esheem,. "SOME HEURISTIC RULES FOR JOB SHOP SCHEDULING PROBLEM". ERJ. Engineering Research Journal, 36, 2, 2013, 167-174. doi: 10.21608/erjm.2013.67066
HARVARD
Boushaala,, A. A., Esheem,, S. (2013). 'SOME HEURISTIC RULES FOR JOB SHOP SCHEDULING PROBLEM', ERJ. Engineering Research Journal, 36(2), pp. 167-174. doi: 10.21608/erjm.2013.67066
VANCOUVER
Boushaala,, A. A., Esheem,, S. SOME HEURISTIC RULES FOR JOB SHOP SCHEDULING PROBLEM. ERJ. Engineering Research Journal, 2013; 36(2): 167-174. doi: 10.21608/erjm.2013.67066
)
View on SCiNiTO