期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 236, 期 2, 页码 445-452出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2013.12.011
关键词
Sequencing; Stochastic scheduling; Earliness/tardiness; Branch and bound; Neighborhood search; Due-date assignment
We address the single-machine stochastic scheduling problem with an objective of minimizing total expected earliness and tardiness costs, assuming that processing times follow normal distributions and due dates are decisions. We develop a branch and bound algorithm to find optimal solutions to this problem and report the results of computational experiments. We also test some heuristic procedures and find that surprisingly good performance can be achieved by a list schedule followed by an adjacent pairwise interchange procedure. (c) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据