Výsledky vyhledávání - "Polynomial and pseudo-polynomial time algorithms"

Theoretical and practical issues in single-machine scheduling with two job release and delivery times Autor Reynoso, Alejandro, Vakhania, Nodari

“…We study a single-machine scheduling problem with two allowable job release and delivery times. This special case of a strongly NP-hard single-machine…”
Získat plný text

Two-parallel machines scheduling with rate-modifying activities to minimize total completion time Autor Zhao, Chuan-Li, Tang, Heng-Yong, Cheng, Cong-Dian

“… We provide polynomial and pseudo-polynomial time algorithms to solve the total completion time minimization problem and total weighted completion time minimization…”
Získat plný text

Single machine scheduling with two competing agents and equal job processing times Autor Oron, Daniel, Shabtay, Dvir, Steiner, George

“…•We provide polynomial and pseudo-polynomial time algorithms for the problems under consideration…”
Získat plný text

Multitasking scheduling problems with two competitive agents Autor Li, Shi-Sheng, Chen, Ren-Xia, Tian, Ji

“…This article addresses several two-agent scheduling problems in the presence of multitasking. Under multitasking, when a task is being executed, it is…”
Získat plný text

The loader problem: formulation, complexity and algorithms Autor Tang, G, Chen, F, Cheng, T C E, Ng, C T, Chen, Z-L

“… practical situations, and propose polynomial and pseudo-polynomial time algorithms for solving these cases…”
Získat plný text

Two-agent single machine scheduling with forbidden intervals Autor Feng, Qi, Li, Shi-sheng, Shang, Wei-ping

“… The goal is to minimize the sum of the objective functions of the two agents. Polynomial and pseudo-polynomial time algorithms are presented for various combinations…”
Získat plný text