A Hybrid Method of Heuristic Algorithm and Constraint Programming for No-wait Integrated Scheduling Problem,ERICDATA高等教育知識庫
高等教育出版
熱門: 謝傳崇  羅文君  葉俊廷  紀金山  SDGs  簡淑芸  
高等教育出版
首頁 臺灣期刊   學校系所   學協會   民間出版   大陸/海外期刊   政府機關   學校系所   學協會   民間出版   DOI註冊服務
閱讀全文
篇名
A Hybrid Method of Heuristic Algorithm and Constraint Programming for No-wait Integrated Scheduling Problem
並列篇名
A Hybrid Method of Heuristic Algorithm and Constraint Programming for No-wait Integrated Scheduling Problem
作者 Zhiqiang XieXiaowei ZhangYingchun XiaJing YangYu Xin
英文摘要
No-wait Integrated Scheduling Problem (NISP) describes a real-life process of the non-standard products where the consideration is given to the great structure differences, processing parameter differences, no-wait constraint, and the need for further deep processing after assembly of jobs. To deal with the dynamic orders of non-standard products, the scheduling algorithm to be design should be a dynamic algorithm with the ability to deal with the above conditions. At first, the dynamic scheduling problem is transformed to a series of continuous static scheduling problem by adoption of window-based event-driven strategy, thus establishing constraint programming model targeted at minimal total tardiness and thereby proposing a hybrid method of Heuristic Algorithm and Constraint Programming (HACP) for the problem. In order to enhance the ability to response the dynamic orders of non-standard products, HA-CP adopts heuristic algorithm to generate a prescheduling solution at each dynamic event moment, so that jobs that fall into the window period are labelled as dispatched jobs, while the remaining jobs are labelled as jobs to be dispatched. To improve solution quality, the jobs to be dispatched are mapped into an operation-based constraint programming model, then, during the execution interval of dispatched jobs, constraint programming solver starts to solve the jobs to be dispatched and update the current solution if the solver gets a better solution within the execution interval. The above procedures are repeated until all jobs are scheduled. Finally, the results of simulation experiment show that the proposed algorithm is effective and feasible.
起訖頁 1083-1090
關鍵詞 Non-standard productsIntegrated schedulingDynamic schedulingNo-waitConstraint programming
刊名 網際網路技術學刊  
期數 202109 (22:5期)
出版單位 台灣學術網路管理委員會
DOI 10.53106/160792642021092205012  複製DOI
QR Code
該期刊
上一篇
lwEPSep: A Lightweight End-to-end Privacy-preserving Security Protocol for CTI Sharing in IoT Environments
該期刊
下一篇
Enhancing Machine Comprehension Using Multi-Knowledge Bases and Offline Answer Span Improving System

高等教育知識庫  閱讀計畫  教育研究月刊  新書優惠  

教師服務
合作出版
期刊徵稿
聯絡高教
高教FB
讀者服務
圖書目錄
教育期刊
訂購服務
活動訊息
數位服務
高等教育知識庫
國際資料庫收錄
投審稿系統
DOI註冊
線上購買
高點網路書店 
元照網路書店
博客來網路書店
教育資源
教育網站
國際教育網站
關於高教
高教簡介
出版授權
合作單位
知識達 知識達 知識達 知識達 知識達 知識達
版權所有‧轉載必究 Copyright2011 高等教育文化事業有限公司  All Rights Reserved
服務信箱:edubook@edubook.com.tw 台北市館前路 26 號 6 樓 Tel:+886-2-23885899 Fax:+886-2-23892500