BICRITERIA SCHEDULING PROBLEM INVOLVING TOTAL TARDINESS AND TOTAL EARLINESS PENALTIES

被引：30
作者：
AZIZOGLU, M
KONDAKCI, S
KIRCA, O
机构：
[1] Middle East Technical University, Department of Industrial Engineering, Ankara
来源：
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 1991年 / 23卷 / 1-3期
关键词：
D O I：
10.1016/0925-5273(91)90044-T
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper considers the problem of minimizing the weighted sum of earliness and tardiness penalties on a single machine. A simple and efficient lower bound is developed and several upper bounds are proposed. A branch and bound procedure incorporating the bounds, precedence relations and dominance properties is proposed. An experiment is designed to test the efficiency of the bounds, precedence relations, etc. Computational experience with problems up to 20 jobs is reported.
引用
收藏
页码：17 / 24
页数：8
相关论文
共 14 条
  • [11] Ow, Morton, The single machine early/tardy problem, Management Science, 35, 2, pp. 177-191, (1989)
  • [12] Tahboub, Wilhelm, Use of a surrogate problem to minimize total earliness-tardiness penalties on a single machine, Working paper No: 1986-010, (1986)
  • [13] Elmaghraby, The one machine sequencing problem with delay costs, J. Industrial Engineering, 19, 2, pp. 105-108, (1969)
  • [14] Fisher, A dual algorithm for the one-machine scheduling problem, Math. Programming, 11, 3, pp. 229-251, (1976)
12