A SURVEY OF RESULTS FOR SEQUENCING PROBLEMS WITH CONTROLLABLE PROCESSING TIMES

被引：157

作者：

NOWICKI, E

ZDRZALKA, S

机构：

[1] Technical University of Wroclaw, Institute of Engineering Cybernetics, 50-372 Wroclaw

来源：

DISCRETE APPLIED MATHEMATICS | 1990年 / 26卷 / 2-3期

关键词：

D O I：

10.1016/0166-218X(90)90105-L

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The paper deals with the sequencing problems in which job processing times, along with a processing order, are decision variables having their own associated linearly varying costs. The existing results in this area are surveyed and some new results are provided. In the paper, an attention is focussed on the computational complexity aspects, polynomial algorithms and the worst-case analysis of approximation algorithms. © 1990.

引用

页码：271 / 287

页数：17

共 21 条

[1] SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY
BLAZEWICZ, J
LENSTRA, JK
KAN, AHGR
[J]. DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) : 11 - 24
[2] DIAZ FMR, 1984, 154 U MANCH DEP DEC
[3] DIAZ FMR, 1983, MULTIOBJECTIVE DECIS
[4] Elmaghraby SalahEldin., 1977, ACTIVITY NETWORKS PR
[5] GRABOWSKI J, 1986, EUR J OPER RES, V28, P58
[6] Graham R. L., 1979, Discrete Optimisation, P287
[7] A GENERALIZED UNIFORM PROCESSOR SYSTEM
ISHII, H
MARTEL, C
MASUDA, T
NISHIDA, T
[J]. OPERATIONS RESEARCH, 1985, 33 (02) : 346 - 362
[8] Jackson J. R., 1955, 43 U CAL MAN SCI RES
[9] Johnson S.M., 1954, NAV RES LOG, V1, P61, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]
[10] Lageweg B.J., 1976, STAT NEERL, V30, P25

← 1 2 3 →