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

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

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

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

Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs Autor Wan, Long, Mei, Jiajie, Du, Jiangze

“…•We design a pseudo-polynomial algorithm for the NP-hard problem.•A related dual fully polynomial time approximation scheme is developed…”
Získať plný text