面向节能无关联平行机调度模型及分支定界法

Model and Branch-and-bound Algorithm for Energy Saving Production Scheduling Problem

工业企业,特别是高耗能行业,不仅要满足交货期和缩小生产周期的要求,而且不断优化能源配置,降低能耗。研究一类新的以延迟和能源消耗的加权最小为目标的生产调度问题。首先,描述问题并分析问题的复杂性。其次,建立混合整数线性规划模型。进一步,我们提出求解该问题的分支定界算法。最后,通过数值实验和数值试验,验证算法的有效性和高效性。

This paper studies scheduling problem where a set of jobs are scheduled on unrelated parallel machines to trade off between the total energy usage and weighted tardiness.By formally describing the new scheduling problem and analyzing the problem＇s complexity,a mixed integer linear programming model is first built.A branch-and-bound algorithm is further proposed.Empirical studies verify the effectiveness and efficiency of algorithms.