A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning Real world combinatorial optimization problems such as scheduling are typically too complex to solve with exact methods. Additionally, the problems often have to observe vaguely specified constraints of different importance, the available data may be uncertain, and compromises between antagonistic criteria may be necessary. We present a combination of approximate reasoning based constraints and iterative optimization based heuristics that help to model and solve such problems in a framework of C++ software libraries called StarFLIP++. While initially developed to schedule continuous caster units in steel plants, we present in this paper results from reusing the library components in a shift scheduling system for the workforce of an industrial production plant.
References in zbMATH (referenced in 2 articles , 1 standard article )
Showing results 1 to 2 of 2.
- Ernst, A.T.; Jiang, H.; Krishnamoorthy, M.; Owens, B.; Sier, D.: An annotated bibliography of personnel scheduling and rostering (2004)
- Raggl, Andreas; Slany, Wolfgang: A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning (1998)