OPAC (Online Public Access Catalog)
Pencarian Koleksi UPA Perpustakaan
start it by typing one or more keywords for title, author or subject
Equivalence of Some Different Maintenance Activities in Single-Machine Scheduling
ZOU, Juan - Personal Name
YUAN, Jin-Jiang - Personal Name
We study single-machine scheduling problems with a single maintenance activity (MA) of length p0 under three types of assumptions: (A) the MA is required in a fixed time interval [T − p0, T ] with T p0 and the job processing is of preemptive and resumable; (B) the MA is required in a relaxed time interval [0, T ] with T p0 and the job processing is of nonpreemptive; (C) the MA is required in a relaxed time interval [T0, T ] with 0 T0 T − p0 and the job processing is of nonpreemptive. We show in this paper that, up to the time complexity for solving scheduling problems assumptions (A) and (B) are equivalent, and moreover, if T − (T0 + p0) is greater
than or equal to the maximum processing time of all jobs, the assumption (C) is also equivalent to (A) and (B). As an application, we study the scheduling for minimizing the weighted number of tardy jobs under the above three assumptions, respectively and present corresponding time-complexity results
than or equal to the maximum processing time of all jobs, the assumption (C) is also equivalent to (A) and (B). As an application, we study the scheduling for minimizing the weighted number of tardy jobs under the above three assumptions, respectively and present corresponding time-complexity results
Availability
| EB00000003621K | Available |
Detail Information
Series Title
-
Call Number
-
Publisher
: ,
Collation
-
Language
ISBN/ISSN
-
Classification
NONE
Detail Information
Content Type
E-Jurnal
Media Type
-
Carrier Type
-
Edition
-
Subject(s)
Specific Detail Info
-
Statement of Responsibility
Juan Zou1,Jin-Jiang Yuan
No other version available
File Attachment
