AN INTERACTIVE APPROACH FOR A DUAL CONSTRAINT JOB SHOP SCHEDULING PROBLEM

1991-01-01
KONDAKCI, S
GUPTA, RM
Until recently, heuristic dispatching rules were the only practical means to solve the job shop scheduling problem. Currently, a promising direction in job shop scheduling is interactive scheduling. In this study an interactive scheduling approach is developed for a dual-constraint dynamic job shop production environment. The approach is used by a number of subjects in an experiment. The performance of the subjects is compared with that of dispatching rules based on tardiness and other measures relevant to the job shop environment. The results indicate that the subjects outperform the dispatching rules in general.

Citation Formats
S. KONDAKCI and R. GUPTA, “AN INTERACTIVE APPROACH FOR A DUAL CONSTRAINT JOB SHOP SCHEDULING PROBLEM,” COMPUTERS & INDUSTRIAL ENGINEERING, vol. 20, no. 3, pp. 293–302, 1991, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65820.