期刊
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 51, 期 17, 页码 5083-5099出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2013.793424
关键词
scheduling; production planning
资金
- China Postdoctoral Science Foundation [2012M521158]
- National Natural Science Foundation of China [11226264]
- NSC of Taiwan [NSC 99-2221-E-035-057-MY3]
In this paper we consider the problem of single-machine batch delivery scheduling with an assignable common due date and controllable processing times. The job processing time is either a linear or a convex function of the amount of a continuously divisible and non-renewable resource allocated to the job. Finished jobs are delivered in batches and there is no capacity limit on each delivery batch. The objective is to find a job sequence, a partition of the job sequence into batches, a common due date, and resource allocation that jointly minimise a cost function based on earliness, weighted number of tardy jobs, job holding, due-date assignment, batch delivery, makespan, and resource consumption. We provide some properties of the optimal solution, and show that the problem with the linear and convex resource consumption functions can be solved in and time, respectively. We also show that some special cases of the problem can be solved by lower-order algorithms.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据