DSpace Repository

Solving Project Scheduling Problems by Minimum Cut

Show simple item record

dc.creator Moehring, Rolf
dc.creator Uetz, Marc
dc.creator Stork, Frederik
dc.creator Schulz, Andreas S.
dc.date 2002-06-07T16:49:33Z
dc.date 2002-06-07T16:49:33Z
dc.date 2002-06-07T16:49:42Z
dc.date.accessioned 2013-05-31T14:10:35Z
dc.date.available 2013-05-31T14:10:35Z
dc.date.issued 2013-05-31
dc.identifier http://hdl.handle.net/1721.1/693
dc.identifier.uri http://koha.mediu.edu.my:8181/jspui/handle/1721
dc.description In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable problems in operations research, and has therefore become a popular playground for the latest optimization techniques, including virtually all local search paradigms. We show that a somewhat more classical mathematical programming approach leads to both competitive feasible solutions and strong lower bounds, within quite reasonable computation times. The basic ingredients of our approach are the Lagrangian relaxation of a time-indexed integer programming formulation and relaxation-based list scheduling, enriched with a useful idea from recent approximation algorithms for machine scheduling problems. The efficiency of the algorithm results from the insight that the relaxed problem can be solved by computing a minimum cut in an appropriately defined directed graph. Our computational study covers different types of resource-constrained project scheduling problems, based on several, notoriously hard test sets, including practical problem instances from chemical production planning.
dc.format 348248 bytes
dc.format application/pdf
dc.language en_US
dc.relation MIT Sloan School of Management Working Paper;4231-02
dc.subject Irregular Costs
dc.subject Linear Programming Relaxation
dc.subject Network Optimization
dc.subject Project Scheduling
dc.subject Resource-constrained Project Scheduling
dc.title Solving Project Scheduling Problems by Minimum Cut

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account