Kowalczyk, Daniel
Overview
Works: | 5 works in 6 publications in 3 languages and 8 library holdings |
---|---|
Roles: | Author, Other |
Classifications: | PQ7609, 860.998 |
Publication Timeline
.
Most widely held works by
Daniel Kowalczyk
An exact algorithm for parallel machine scheduling with conflicts by
Daniel Kowalczyk(
)
2 editions published between 2015 and 2016 in English and held by 3 WorldCat member libraries worldwide
2 editions published between 2015 and 2016 in English and held by 3 WorldCat member libraries worldwide
Gmina Borzęcin z lotu ptaka by
Janusz Kwaśniak(
Book
)
1 edition published in 2013 in Polish and held by 2 WorldCat member libraries worldwide
1 edition published in 2013 in Polish and held by 2 WorldCat member libraries worldwide
ANGEL CANALLA autobiografia de don angel zof by
Guillermo Ferretti(
)
1 edition published in 2013 in Spanish and held by 1 WorldCat member library worldwide
1 edition published in 2013 in Spanish and held by 1 WorldCat member library worldwide
A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching by
Daniel Kowalczyk(
)
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
The Robust Machine Availability Problem by
Guopeng Song(
)
1 edition published in 2017 in English and held by 1 WorldCat member library worldwide
We define and solve the robust machine availability problem in a parallel machine environment, which aims to minimize the number of identical machines required while completing all the jobs before a given deadline. Our formulation preserves a user-defined robustness level regarding possible deviations in the job durations. For better computational performance, a branch-and-price procedure is proposed based on a set covering reformulation. We use zero-suppressed binary decision diagrams (ZDDs) for solving the pricing problem, which enable us to manage the difficulty entailed by the robustness considerations as well as by extra constraints imposed by branching decisions. Computational results are reported that show the effectiveness of a pricing solver with ZDDs compared with a MIP solver
1 edition published in 2017 in English and held by 1 WorldCat member library worldwide
We define and solve the robust machine availability problem in a parallel machine environment, which aims to minimize the number of identical machines required while completing all the jobs before a given deadline. Our formulation preserves a user-defined robustness level regarding possible deviations in the job durations. For better computational performance, a branch-and-price procedure is proposed based on a set covering reformulation. We use zero-suppressed binary decision diagrams (ZDDs) for solving the pricing problem, which enable us to manage the difficulty entailed by the robustness considerations as well as by extra constraints imposed by branching decisions. Computational results are reported that show the effectiveness of a pricing solver with ZDDs compared with a MIP solver
Audience Level
0 |
![]() |
1 | ||
General | Special |

- Leus, Roel Other Contributor
- Kwaśniak, Janusz (1975- ). Author
- SpringerLink (Online service)
- Mazur, Maciej (wydawca)
- Ferretti, Guillermo Author
- Song, Guopeng Author