Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45022-x_74 ◽

2000 ◽

pp. 878-889 ◽

Author(s):

Klaus Jansen ◽

Lorant Porkolab

Keyword(s):

Polynomial Time ◽

Job Shop ◽

Job Shop Scheduling ◽

Approximation Schemes ◽

Time Approximation ◽

Shop Scheduling ◽

Polynomial Time Approximation

Download Full-text

Polynomial time approximation schemes for general multiprocessor job shop scheduling

Journal of Algorithms ◽

10.1016/s0196-6774(02)00248-1 ◽

2002 ◽

Vol 45 (2) ◽

pp. 167-191 ◽

Author(s):

Klaus Jansen ◽

Lorant Porkolab

Keyword(s):

Polynomial Time ◽

Job Shop ◽

Job Shop Scheduling ◽

Approximation Schemes ◽

Time Approximation ◽

Shop Scheduling ◽

Polynomial Time Approximation

Download Full-text

Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints

Naval Research Logistics (NRL) ◽

10.1002/nav.20122 ◽

2005 ◽

Vol 53 (1) ◽

pp. 16-23 ◽

Author(s):

M.A. Kubzin ◽

V.A. Strusevich ◽

J. Breit ◽

G. Schmidt

Keyword(s):

Polynomial Time ◽

Open Shop ◽

Approximation Schemes ◽

Open Shop Scheduling ◽

Time Approximation ◽

Shop Scheduling ◽

Polynomial Time Approximation

Download Full-text

Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem

STACS 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-46541-3_38 ◽

2000 ◽

pp. 455-465 ◽

Author(s):

Klaus Jansen ◽

Maxim I. Sviridenko

Keyword(s):

Polynomial Time ◽

Flow Shop ◽

Flow Shop Scheduling ◽

Approximation Schemes ◽

Scheduling Problem ◽

Time Approximation ◽

Shop Scheduling ◽

Polynomial Time Approximation

Download Full-text

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM ◽

10.1145/290179.290180 ◽

1998 ◽

Vol 45 (5) ◽

pp. 753-782 ◽

Author(s):

Sanjeev Arora

Keyword(s):

Polynomial Time ◽

Traveling Salesman ◽

Approximation Schemes ◽

Time Approximation ◽

Geometric Problems ◽

Polynomial Time Approximation

Download Full-text

Asymptotic Polynomial-Time Approximation Schemes

Handbook of Approximation Algorithms and Metaheuristics - Chapman & Hall/CRC Computer & Information Science Series ◽

10.1201/9781420010749.ch11 ◽

2007 ◽

pp. 11-1-11-15

Author(s):

An Zhu ◽

Rajeev Motwani ◽

Liadan O’Callaghan

Keyword(s):

Polynomial Time ◽

Approximation Schemes ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Asymptotic Polynomial-Time Approximation Schemes

Handbook of Approximation Algorithms and Metaheuristics ◽

10.1201/9781420010749-17 ◽

2007 ◽

pp. 181-196

Keyword(s):

Polynomial Time ◽

Approximation Schemes ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Polynomial-Time Approximation Schemes for Circle Packing Problems

Algorithms - ESA 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44777-2_59 ◽

2014 ◽

pp. 713-724 ◽

Author(s):

Flávio K. Miyazawa ◽

Lehilton L. C. Pedrosa ◽

Rafael C. S. Schouery ◽

Maxim Sviridenko ◽

Yoshiko Wakabayashi

Keyword(s):

Polynomial Time ◽

Circle Packing ◽

Approximation Schemes ◽

Packing Problems ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Polynomial Time Approximation Schemes and Parameterized Complexity

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_38 ◽

2004 ◽

pp. 500-512 ◽

Author(s):

Jianer Chen ◽

Xiuzhen Huang ◽

Iyad A. Kanj ◽

Ge Xia

Keyword(s):

Polynomial Time ◽

Parameterized Complexity ◽

Approximation Schemes ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74510-5_20 ◽

2007 ◽

pp. 182-193 ◽

Author(s):

Peter Jonsson ◽

Andrei Krokhin ◽

Fredrik Kuivinen

Keyword(s):

Polynomial Time ◽

Constraint Satisfaction ◽

Constraint Satisfaction Problems ◽

Approximation Schemes ◽

Hard Constraint ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times

Journal of Scheduling ◽

10.1007/s10951-019-00616-8 ◽

2019 ◽

Vol 23 (6) ◽

pp. 643-648 ◽

Author(s):

Nir Halman

Keyword(s):

Polynomial Time ◽

Deteriorating Jobs ◽

Technical Note ◽

Approximation Schemes ◽

Time Approximation ◽

Processing Times ◽

Nonlinear Processing ◽

Polynomial Time Approximation

Download Full-text