ISIS—a knowledge‐based system for factory scheduling

TLDR

Job shop scheduling hinges on satisfying numerous constraints, including due dates, costs, production levels, machine capabilities, substitutability, alternative processes, order characteristics, resource requirements, and availability. This paper presents ISIS, a scheduling system that incorporates all relevant constraints into job shop schedule construction. ISIS represents constraints explicitly and uses them to guide a constraint‑directed search for acceptable schedules, addressing constraint relaxation and offering interactive scheduling facilities.

Abstract

Abstract: Analysis of the job shop scheduling domain has indicated that the crux of the scheduling problem is the determination and satisfaction of a large variety of constraints. Schedules are influenced by such diverse and conflicting factors as due date requirements, cost restrictions, production levels, machine capabilities and substitutability, alternative production processes, order characteristics, resource requirements, and resource availability. This paper describes ISIS, a scheduling system capable of incorporating all relevant constraints in the construction of job shop schedules. We examine both the representation of constraints within ISIS, and the manner in which these constraints are used in conducting a constraint‐directed search for an acceptable schedule. The important issues relating to the relaxation of constraints are addressed. Finally, the interactive scheduling facilities provided by ISIS are considered.