{"title":"Dynamic scheduling of manufacturing orders: a decision support system approach","authors":"A. Almeida, C. Ramos, S. Silva","doi":"10.1109/ISATP.1999.782994","DOIUrl":null,"url":null,"abstract":"This paper presents a decision support system (DSS) based architecture and a new method for the dynamic scheduling of manufacturing systems. The proposed architecture is based on the DSS paradigm. The typical scheduling problems, namely the order allocation and order sequencing problems, are to be solved for a given production plan which defines a set of manufacturing orders to be processed. These specify product types to be manufactured, their quantities and due dates. The allocation problem deals with the assignment of n orders to m manufacturing processors, under the given production plan, and the solution to the sequencing problem identifies the input sequence and the instants of processing of the assigned orders on each manufacturing processor.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISATP.1999.782994","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper presents a decision support system (DSS) based architecture and a new method for the dynamic scheduling of manufacturing systems. The proposed architecture is based on the DSS paradigm. The typical scheduling problems, namely the order allocation and order sequencing problems, are to be solved for a given production plan which defines a set of manufacturing orders to be processed. These specify product types to be manufactured, their quantities and due dates. The allocation problem deals with the assignment of n orders to m manufacturing processors, under the given production plan, and the solution to the sequencing problem identifies the input sequence and the instants of processing of the assigned orders on each manufacturing processor.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
