Výsledky vyhľadávania - Scheduling Deteriorating jobs Complexity theory Fully polynomial-time approximation scheme

A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs Autor Kang, Liying, Ng, C.T.

“… Each job's processing time is a linear nondecreasing function of its start time. We present a fully polynomial-time approximation scheme for the problem, thus…”
Získať plný text

Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs Autor Zhao, Chuanli, Hsu, Chou-Jung

“… The objective is to minimize the weighted number of tardy jobs. A pseudo-polynomial dynamic programming algorithm and a fully polynomial-time approximation scheme…”
Získať plný text

Complexity and approximability of scheduling resumable proportionally deteriorating jobs Autor Gawiejnowicz, Stanisław, Kononov, Alexander

“… It is also proved that for the problem with a single non-availability period there exists a fully polynomial-time approximation scheme…”
Získať plný text

Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times: Algorithms and Approximation Schemes Autor Shabtay, Dvir, Mor, Baruch

“…We study two scheduling problems in a proportionate flow shop environment, where job processing times are machine independent…”
Získať plný text

“Product Partition” and related problems of scheduling and systems reliability: Computational complexity and approximation Autor Ng, C.T., Barketau, M.S., Cheng, T.C.E., Kovalyov, Mikhail Y.

“… Our results imply the strong NP-hardness of a number of scheduling problems with start-time-dependent job processing times and a problem of designing a reliable system with a series–parallel structure…”
Získať plný text

Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan Autor Ji, Min, Cheng, T.C.E.

“…We consider a scheduling problem in which n jobs are to be processed on a single machine…”
Získať plný text

Parallel-machine scheduling of simple linear deteriorating jobs Autor Ji, Min, Cheng, T.C.E.

“… . When the number of machines is fixed, we propose two similar fully polynomial-time approximation schemes for the former two problems…”
Získať plný text

Single-machine batch scheduling of linear deteriorating jobs Autor Ji, Min, Yang, Qinyun, Yao, Danli, Cheng, T.C.E.

“… The objective is to minimize the sum of the total job flow time and the batching cost. We first show that the case with a given number of batches is strongly NP-hard and we present a fully polynomial-time approximation scheme (FPTAS) for this case…”
Získať plný text

Scheduling linear deteriorating jobs with an availability constraint on a single machine Autor Ji, Min, He, Yong, Cheng, T.C.E.

Získať plný text

Scheduling jobs with a V-shaped time-dependent processing time Autor Sedding, Helmut A.

“…In the field of time-dependent scheduling, a job’s processing time is specified by a function of its start time…”
Získať plný text

Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration Autor Ji, Min, Hsu, Chou-Jung, Yang, Dar-Li

“…This article studies a single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity…”
Získať plný text

On A Scheduling Problem of Time Deteriorating Jobs Autor Cai, Jin-Yi, Cai, Pu, Zhu, Yixin

“… We develop a fully polynomial time approximation scheme for the problem in this case. We also give further NP-hardness results, and a polynomial time algorithm…”
Získať plný text