Arbeitspapier

A boolean satisfiability approach to the resource-constrained project scheduling problem

We formulate the resource-constrained project scheduling problem as a satisfiabil-ity problem and adapt a satisfiability solver for the specific domain of the problem. Our solver is lightweight and shows good performance both in finding feasible solutions and in proving lower bounds. Our numerical tests allowed us to close several benchmark instances of the RCPSP that have never been closed before by proving tighter lower bounds and by finding better feasible solutions. Using our method we solve optimally more instances of medium and large size from the benchmark library PSPLIB and do it faster compared to any other existing solver.

Language
Englisch

Bibliographic citation
Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; No. 644

Classification
Management
Subject
Scheduling-Verfahren
Ganzzahlige Optimierung

Event
Geistige Schöpfung
(who)
Horbach, Andrei
Event
Veröffentlichung
(who)
Universität Kiel, Institut für Betriebswirtschaftslehre
(where)
Kiel
(when)
2009

Handle
Last update
10.03.2025, 11:44 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Arbeitspapier

Associated

  • Horbach, Andrei
  • Universität Kiel, Institut für Betriebswirtschaftslehre

Time of origin

  • 2009

Other Objects (12)