No-Wait Scheduling for Locks

32 Pages Posted: 14 Mar 2016

See all articles by Ward Passchyn

Ward Passchyn

KU Leuven - Faculty of Business and Economics (FEB)

Dirk Briskorn

University of Siegen

Frits Spieksma

Catholic University of Leuven (KUL)

Date Written: March 1, 2016

Abstract

We investigate a problem inspired by the practical setting of scheduling a lock with parallel chambers. We show how this problem relates to known interval scheduling problems, as well as to a particular graph coloring problem on multiple unit interval graphs. We explore the relationships between these problems and discuss the complexity of different problem variants. In particular, for a lock consisting of two chambers we are able to characterize the feasible instances and use this result to obtain efficient algorithms. We also provide an efficient algorithm for the special case with identical lock chambers. Furthermore, we describe a dynamic programming approach for the more general case with arbitrary chambers, and prove that the problem is strongly NP-complete when the number of chambers is part of the input.

Keywords: Lock scheduling, Graph coloring, Interval scheduling

Suggested Citation

Passchyn, Ward and Briskorn, Dirk and Spieksma, Frits, No-Wait Scheduling for Locks (March 1, 2016). Available at SSRN: https://ssrn.com/abstract=2747309 or http://dx.doi.org/10.2139/ssrn.2747309

Ward Passchyn (Contact Author)

KU Leuven - Faculty of Business and Economics (FEB) ( email )

Naamsestraat 69
Leuven, B-3000
Belgium

Dirk Briskorn

University of Siegen ( email )

Hoelderlinstrasse 3
57068 Siegen, NRW 57068
Germany

Frits Spieksma

Catholic University of Leuven (KUL) ( email )

Leuven, B-3000
Belgium

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
78
Abstract Views
510
Rank
559,655
PlumX Metrics