A min-max model for reactive job shop scheduling

We consider the problem of modeling and controlling a restricted class of job shop scheduling problem. The considered class is described and in the sequel we propose a mathematical model based on min-max (dioid) theory. A dynamic equation is then written in this framework. We propose also three heuristic based control laws, simulate them for randomly obtained job shop problems and compare the results with those obtained by exhaustive search.