Over the last fifty years a considerable amount of research effort has been focusedon deterministic scheduling. The number and variety of models consideredis astounding. During this time a notation has evolved that succinctly captures the structure of many (but for sure not all) deterministic models that have been considered in the literature
KeywordsSchedule Problem Deterministic Model Travelling Salesman Problem Flow Shop Precedence Constraint
Unable to display preview. Download preview PDF.