SOME PREEMPTIVE OPEN SHOP SCHEDULING PROBLEMS WITH A RENEWABLE OR A NONRENEWABLE RESOURCE

被引：12

作者：

DEWERRA, D ^{[1
]}

BLAZEWICZ, J ^{[1
]}

机构：

[1] POLYTECH POZNANSKA,INST INFORMAT,POZNAN,POLAND

来源：

DISCRETE APPLIED MATHEMATICS | 1992年 / 35卷 / 03期

关键词：

EDGE COLORING; OPEN SHOP PREEMPTIVE SCHEDULE; RENEWABLE AND NONRENEWABLE RESOURCE;

D O I：

10.1016/0166-218X(92)90245-6

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

An edge coloring model is presented for a preemptive open shop problem. Constraints generated by a single resource have to be taken into account. The case of a renewable and of a nonrenewable resource as considered. Since the existence of a schedule is an NP-complete problem in both cases we present some cases which are solvable in polynomial time.

引用

页码：205 / 219

页数：15

共 50 条

[1] SOME PREEMPTIVE OPEN SHOP SCHEDULING PROBLEMS WITH A RENEWABLE OR A NONRENEWABLE RESOURCE (VOL 35, PG 205, 1992)
DEWERRA, D
BLAZEWICZ, J
[J]. DISCRETE APPLIED MATHEMATICS, 1993, 43 (01) : 103 - 104
[2] A PREEMPTIVE OPEN SHOP SCHEDULING PROBLEM WITH ONE RESOURCE
DEWERRA, D
BLAZEWICZ, J
KUBIAK, W
[J]. OPERATIONS RESEARCH LETTERS, 1991, 10 (01) : 9 - 15
[3] ON THE COMPLEXITY OF PREEMPTIVE OPEN-SHOP SCHEDULING PROBLEMS
LIU, CY
BULFIN, RL
[J]. OPERATIONS RESEARCH LETTERS, 1985, 4 (02) : 71 - 74
[4] Polynomial algorithms for some scheduling problems with one nonrenewable resource
Sahli, Abderrahim
Carlier, Jacques
Moukrim, Aziz
[J]. RAIRO-OPERATIONS RESEARCH, 2021, 55 (06) : 3493 - 3511
[5] JOB-SHOP SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT
TOKER, A
KONDAKCI, S
ERKIP, N
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1994, 45 (08) : 942 - 947
[6] Restrictions and preassignments in preemptive open shop scheduling
deWerra, D
Hoffman, AJ
Mahadev, NVR
Peled, UN
[J]. DISCRETE APPLIED MATHEMATICS, 1996, 68 (1-2) : 169 - 188
[7] Mathematical models for preemptive shop scheduling problems
Ebadi, Abbas
Moslehi, Ghasem
[J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) : 1605 - 1614
[8] Resource constraints for preemptive job-shop scheduling
Pape C.L.E.
Baptiste P.
[J]. Constraints, 1998, 3 (4) : 263 - 287
[9] Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
de Werra, Dominique
Kis, Tamas
Kubiak, Wieslaw
[J]. JOURNAL OF SCHEDULING, 2008, 11 (01) : 75 - 83
[10] Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
Dominique de Werra
Tamás Kis
Wieslaw Kubiak
[J]. Journal of Scheduling, 2008, 11 : 75 - 83

← 1 2 3 4 5 →