{"title":"Scheplan-a scheduling expert for steel-making process","authors":"M. Numao, S. Morishita","doi":"10.1109/AIIA.1988.13333","DOIUrl":null,"url":null,"abstract":"Scheplan is an expert system kernel that was developed for scheduling steel-making processes. The typical constraints in such processes are a fixed sequence of production stages, no machine conflicts among products, low waiting time, continuous use of some machines, and a resting time requirement for some machines. The approach presented for designing a schedule that satisfies the constraints, is not to obtain an optimal solution, but rather to obtain a feasible solution efficiently. The reason for this is that it is very difficult to define an evaluation function for the optimum, and that a combinatorial explosion may prevent a schedule from being obtained in a reasonable time. A cooperative schedule method is introduced in which the system efficiently generates a candidate schedule by a subscheduling and merging method, and the user evaluates and modifies the candidate schedule by interactive refinement.<<ETX>>","PeriodicalId":112397,"journal":{"name":"Proceedings of the International Workshop on Artificial Intelligence for Industrial Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Workshop on Artificial Intelligence for Industrial Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIIA.1988.13333","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheplan-a scheduling expert for steel-making process
Scheplan is an expert system kernel that was developed for scheduling steel-making processes. The typical constraints in such processes are a fixed sequence of production stages, no machine conflicts among products, low waiting time, continuous use of some machines, and a resting time requirement for some machines. The approach presented for designing a schedule that satisfies the constraints, is not to obtain an optimal solution, but rather to obtain a feasible solution efficiently. The reason for this is that it is very difficult to define an evaluation function for the optimum, and that a combinatorial explosion may prevent a schedule from being obtained in a reasonable time. A cooperative schedule method is introduced in which the system efficiently generates a candidate schedule by a subscheduling and merging method, and the user evaluates and modifies the candidate schedule by interactive refinement.<>