啦啦啦精彩视频免费观看在线,丰满大屁股熟女啪播放,暖暖视频在线观看免费最新,亚洲V天堂,无码爽到爆高潮抽搐喷水在线观看,91亚洲国产一区二区

ENGLISH
您所在的位置: 首頁» 新聞中心» 講座預(yù)告

【明理講堂2023年第19期】4-14紐卡斯?fàn)柎髮W(xué)Raymond Chiong教授:Energy-efficient production scheduling through machine on/off control

時間:4月14日(星期五)下午15:30-17:30

地點(diǎn):中關(guān)村主樓217

報(bào)告人:紐卡斯?fàn)柎髮W(xué) Raymond Chiong 教授

報(bào)告人簡介:

Prof. Raymond Chiong is a tenured academic staff member with the University of Newcastle, Australia. His research areas include agent-based modelling, machine learning, and optimisation. Raymond is the Editor-in-Chief of the Journal of Systems and Information Technology, and an Editor for the journal Engineering Applications of Artificial Intelligence. He has also served in a Guest Editor role for a number of reputable international journals, such as the International Journal of Production Economics and European Journal of Operational Research. To date, Raymond has published more than 250 papers. His publications have been cited over 6000 times, and his h-index is close to 40.

報(bào)告內(nèi)容簡介:

This talk will discuss about the research on the use of machine on/off control for energy-efficient productions scheduling, which is an important extension of energy-efficient production scheduling research. The inspiration of this extension is that a machine must be turned off if it needs to be maintained, and an already-turned-off machine can be maintained without needing to be restarted. We therefore formulate an energy-efficient production scheduling problem with machine maintenance through machine on/off control, aiming to optimise three objectives – the makespan, total number of machine restarts, and energy consumption – at the same time. Four rules are designed to set the machine on/off criteria, maintenance periods and predefined maintenance window. Three effective heuristics are proposed to insert the maintenance activities into the solutions and move their maintenance-operation blocks to optimise the objectives.Our proposed heuristics, unlike traditionalheuristic algorithms, are expected to be applicable and effective even if we change the objectives and constraints, require minimal computational time (only a few seconds) to optimise a scheduling solution, and can solve different types of scheduling problems without needing any modification.

(承辦:管理工程系、科研與學(xué)術(shù)交流中心)

TOP