Scheduling Scarce Resources in Chemical Engineering
| dc.contributor.author | Möhring, Rolf H. | |
| dc.contributor.author | Uetz, Marc | |
| dc.date.accessioned | 2022-05-11T12:11:45Z | |
| dc.date.available | 2022-05-11T12:11:45Z | |
| dc.date.issued | 2000 | |
| dc.description.abstract | The efficient utilization of scarce resources, such as machines or manpower, is major challenge within production planning in the chemical industry. We describe solution methods for a resource-constrained scheduling problem which arises at a production facility at BASF AG in Ludwigshafen. We have developed and implemented two different algorithms to solve this problem, a novel approach which is based upon Lagrangian relaxation, as well as a branch-and-bound procedure. Since the Lagrangian approach is applicable for a whole variety of resource-constrained scheduling problems, it is of interest not only for the specific problem we describe, but is of interest also for many other industrial applications. In this paper, we describe both approaches, and also report on computational results, based upon practical problem instances as well as benchmark test sets. | en |
| dc.identifier.issn | 2197-8085 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/16902 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-15680 | |
| dc.language.iso | en | |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
| dc.subject.ddc | 510 Mathematik | en |
| dc.subject.other | scheduling problems | en |
| dc.subject.other | chemical industry | en |
| dc.subject.other | Lagrangian relaxation | en |
| dc.subject.other | scarce resources | en |
| dc.title | Scheduling Scarce Resources in Chemical Engineering | en |
| dc.type | Research Paper | en |
| dc.type.version | submittedVersion | en |
| tub.accessrights.dnb | free | |
| tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
| tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
| tub.affiliation.institute | Inst. Mathematik | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |
| tub.series.issuenumber | 2000, 682 | en |
| tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
| tub.subject.msc2000 | 90B35 Deterministic scheduling theory in operations research | en |
| tub.subject.msc2000 | 90B90 Case-oriented studies in operations research | en |
| tub.subject.msc2000 | 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut | en |
| tub.subject.msc2000 | 90C10 Integer programming | en |