Generation of look-up tables for dynamic job shop scheduling decision support tool

• Main Authors: Oktaviandri, M., Hassan, A., Shaharoun, A. M.
• Format: Conference or Workshop Item
• Published: Institute of Physics Publishing 2016
• Subjects: HD Industries. Land use. Labor
• Online Access: http://eprints.utm.my/id/eprint/73367/; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84973102511&doi=10.1088%2f1757-899X%2f114%2f1%2f012067&partnerID=40&md5=176948b754c8d8f7d769e80d2484a3b0

Majority of existing scheduling techniques are based on static demand and deterministic processing time, while most job shop scheduling problem are concerned with dynamic demand and stochastic processing time. As a consequence, the solutions obtained from the traditional scheduling technique are ineffective wherever changes occur to the system. Therefore, this research intends to develop a decision support tool (DST) based on promising artificial intelligent that is able to accommodate the dynamics that regularly occur in job shop scheduling problem. The DST was designed through three phases, i.e. (i) the look-up table generation, (ii) inverse model development and (iii) integration of DST components. This paper reports the generation of look-up tables for various scenarios as a part in development of the DST. A discrete event simulation model was used to compare the performance among SPT, EDD, FCFS, S/OPN and Slack rules; the best performances measures (mean flow time, mean tardiness and mean lateness) and the job order requirement (inter-arrival time, due dates tightness and setup time ratio) which were compiled into look-up tables. The well-known 6/6/J/Cmax Problem from Muth and Thompson (1963) was used as a case study. In the future, the performance measure of various scheduling scenarios and the job order requirement will be mapped using ANN inverse model.