The Second International Workshop on Dynamic Scheduling Problems
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Polish Mathematical Society

9788395129803

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Scheduling non-preemptive data gathering affected by background communications

The Second International Workshop on Dynamic Scheduling Problems ◽

10.14708/isbn.978-83-951298-0-3p43-46 ◽

2018 ◽

Author(s):

Joanna Berlińska

Keyword(s):

Data Gathering

Download Full-text

Approximation algorithms for energy efficient scheduling of parallel jobs without migration

The Second International Workshop on Dynamic Scheduling Problems ◽

10.14708/isbn.978-83-951298-0-3p65-68 ◽

2018 ◽

Author(s):

Alexander Kononov ◽

Yulia Kovalenko

Keyword(s):

Approximation Algorithms ◽

Energy Efficient ◽

Parallel Jobs ◽

Energy Efficient Scheduling

Download Full-text

General inequalities in the set-dependent scheduling

The Second International Workshop on Dynamic Scheduling Problems ◽

10.14708/isbn.978-83-951298-0-3p39-42 ◽

2018 ◽

Author(s):

Maksim Barketau

Download Full-text

Algorithms for energy-efficient scheduling

The Second International Workshop on Dynamic Scheduling Problems ◽

10.14708/isbn.978-83-951298-0-3p25-28 ◽

2018 ◽

Author(s):

Evripidis Bampis

Keyword(s):

Energy Efficient ◽

Energy Efficient Scheduling

Download Full-text

Two matheuristics for problem 1|p_j = 1 + b_j t|sum C_j

The Second International Workshop on Dynamic Scheduling Problems ◽

10.14708/isbn.978-83-951298-0-3p47-52 ◽

2018 ◽

Author(s):

Stanisław Gawiejnowicz ◽

Wiesław Kurc

Download Full-text

Minmax scheduling and due-window assignment with position-dependent processing times and job rejection

The Second International Workshop on Dynamic Scheduling Problems ◽

10.14708/isbn.978-83-951298-0-3p73-76 ◽

2018 ◽

Author(s):

Gur Mosheiov ◽

Assaf Sarig ◽

Vitaly A. Strusevich

Keyword(s):

Job Rejection ◽

Processing Times ◽

Due Window ◽

Due Window Assignment

Download Full-text

Single machine scheduling to minimize total completion time under positional and cumulative deterioration effects

The Second International Workshop on Dynamic Scheduling Problems ◽

10.14708/isbn.978-83-951298-0-3p93-96 ◽

2018 ◽

Author(s):

Alan Soper ◽

Vitaly A. Strusevich

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Completion Time ◽

Cumulative Deterioration

Download Full-text

FPTASes for minimizing makespan of deteriorating jobs with non-linear processing times

The Second International Workshop on Dynamic Scheduling Problems ◽

10.14708/isbn.978-83-951298-0-3p53-58 ◽

2018 ◽

Author(s):

Nir Halman

Keyword(s):

Deteriorating Jobs ◽

Processing Times ◽

Non Linear

Download Full-text

Precedence constrained parallel-machine scheduling of position-dependent unit jobs

The Second International Workshop on Dynamic Scheduling Problems ◽

10.14708/isbn.978-83-951298-0-3p77-80 ◽

2018 ◽

Author(s):

Bartłomiej Przybylski

Keyword(s):

Machine Scheduling ◽

Parallel Machine Scheduling ◽

Parallel Machine

Download Full-text

Scheduling non-monotonous convex piecewise-linear time-dependent processing times of a uniform shape

The Second International Workshop on Dynamic Scheduling Problems ◽

10.14708/isbn.978-83-951298-0-3p81-86 ◽

2018 ◽

Author(s):

Helmut A. Sedding

Keyword(s):

Linear Time ◽

Piecewise Linear ◽

Time Dependent ◽

Processing Times

Download Full-text

The Second International Workshop on Dynamic Scheduling ProblemsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Polish Mathematical Society

Scheduling non-preemptive data gathering affected by background communications

Approximation algorithms for energy efficient scheduling of parallel jobs without migration

General inequalities in the set-dependent scheduling

Algorithms for energy-efficient scheduling

Two matheuristics for problem 1|p_j = 1 + b_j t|sum C_j

Minmax scheduling and due-window assignment with position-dependent processing times and job rejection

Single machine scheduling to minimize total completion time under positional and cumulative deterioration effects

FPTASes for minimizing makespan of deteriorating jobs with non-linear processing times

Precedence constrained parallel-machine scheduling of position-dependent unit jobs

Scheduling non-monotonous convex piecewise-linear time-dependent processing times of a uniform shape

The Second International Workshop on Dynamic Scheduling Problems
Latest Publications