Scheduling a single machine to minimize a regular objective function under setup constraints
Scheduling a single machine to minimize a regular objective function under setup constraints
复制标题
调度一台机器以在设置约束下最小化常规目标函数
DOI：
10.1016/j.disopt.2004.12.003
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
C. L. Pape
中科院分区：
文献类型：
--
作者：
P. Baptiste;C. L. Pape
受工业应用的启发，我们研究调度的情况下，一组受发布日期和截止日期的工作是在一台机器上执行。目标是最小化正则和目标函数∑ ifi，其中fi（Ci）对应于在Ci时刻完成作业的成本。除此之外，我们还考虑了作业族之间的设置时间和设置成本，以及一些作业可以“不执行”以减少机器负载的事实。我们介绍了这个问题的下界和优势的性质，我们描述了一个分支和约束传播定界过程。报告了实验结果。
Motivated by industrial applications, we study the scheduling situation in which a set of jobs subjected to release dates and deadlines are to be performed on a single machine. The objective is to minimize a regular sum objective function ∑ifiwhere fi(Ci) corresponds to the cost of the completion of job Jiat time Ci. On top of this, we also take into account setup times and setup costs between families of jobs as well as the fact that some jobs can be “unperformed” to reduce the load of the machine. We introduce lower bounds and dominance properties for this problem and we describe a Branch and Bound procedure with constraint propagation. Experimental results are reported.