2009Unpublished venueOpen access

Online scheduling and project scheduling

Jacob Jan Paulus

Open full text 0 citations

Abstract

Composition of the Graduation Committee:This thesis is the result of four years working together with many interesting people.Therefore, it seems unfair that only my name is on the cover of this book.I would like to pause and say a few words of thanks.First and foremost, I have to thank Johann Hurink.Back when I was writing my Master's thesis he was the one who encouraged me to pursue a Ph.D. degree.He gave me the opportunity and freedom to work on the scheduling problems described in this thesis.The advice he gave me as a supervisor and sometimes as a mentor was of great value to me.I enjoyed the many discussions we had, both on and off subject.By enjoying each others suggestions and enthusiasm, and by debating as being peers, he gave me much more than I could possibly ask for.Secondly, I am thankfull to the people that I had the privilege and pleasure to worked with, in particular to Marco Schutten and Walter Kern.Our stimulating discussions and their insights are of great value to me and my work.The research done together with Tom Guldemond and Leendert Kok has not only resulted in their graduation

Open-access reader

About this research paper

What this paper is about

Composition of the Graduation Committee:This thesis is the result of four years working together with many interesting people.Therefore, it seems unfair that only my name is on the cover of this book.I would like to pause and say a few words of thanks.First and foremost, I have to thank Johann Hurink.Back when I was writing my Master's thesis he was the one who encouraged me to pursue a Ph.D. degree.He gave me the opportunity and freedom to work on the scheduling problems described in this thesis.The advice he gave me as a supervisor and sometimes as a mentor was of great value to me.I enjoyed the many discussions we had, both on and off subject.By enjoying each others suggestions and enthusiasm, and by debating as being peers, he gave me much more than I could possibly ask for.Secondly, I am thankfull to the people that I had the privilege and pleasure to worked with, in particular to Marco Schutten and Walter Kern.Our stimulating discussions and their insights are of great value to me and my work.The research done together with Tom Guldemond and Leendert Kok has not only resulted in their graduation

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Composition of the Graduation Committee:This thesis is the result of four years working together with many interesting people.Therefore, it seems unfair that only my name is on the cover of this book.I would like to pause and say a few words of thanks.First and foremost, I have to thank Johann Hurink.Back when I was writing my Master's thesis he was the one who encouraged me to pursue a Ph.D. degree.He gave me the opportunity and freedom to work on the scheduling problems described in this thesis.The advice he gave me as a supervisor and sometimes as a mentor was of great value to me.I enjoyed the many discussions we had, both on and off subject.By enjoying each others suggestions and enthusiasm, and by debating as being peers, he gave me much more than I could possibly ask for.Secondly, I am thankfull to the people that I had the privilege and pleasure to worked with, in particular to Marco Schutten and Walter Kern.Our stimulating discussions and their insights are of great value to me and my work.The research done together with Tom Guldemond and Leendert Kok has not only resulted in their graduation

Key concepts: Job shop scheduling, Computer science, Online algorithm, Competitive analysis, Rate-monotonic scheduling, Fair-share scheduling, Scheduling (production processes), Dynamic priority scheduling

Related papers

Back to paper searchBrowse research topicsOriginal source
Online scheduling and project scheduling — Research Paper | ScholarLens