期刊
THEORETICAL COMPUTER SCIENCE
卷 438, 期 -, 页码 55-61出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2012.03.009
关键词
Scheduling; Past-sequence-dependent delivery times; Single-machine
资金
- Fundamental Research Funds for the Central Universities [2010KJ035]
- National Science Foundation of China [71101106, 71172189, 71171149, 70832005, 71090404/71090400]
Scheduling with past-sequence-dependent (psd) delivery times is motivated by questions that arise in the electronic manufacturing industry: an electronic component may be exposed to certain a electromagnetic field while waiting for processing and is required to neutralize the effect of electromagnetism. The time spent on the neutralization process has been modeled as psd delivery time in the literature. In this paper, we consider single-machine scheduling problems with psd delivery times. We respectively derive polynomial algorithms for the following objective functions: the minimization of the total weighted completion time, the total weighted discounted completion time, the total absolute differences in completion times and the sum of earliness, tardiness and common due date penalty. At last, for the criteria of minimization the total weighted tardiness, we propose a polynomial algorithm to optimally solve the problem under a certain condition. (C) 2012 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据