This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
This paper investigates two integer linear programming models that integrate requirement scheduling into software release planning. The first model can schedule the development of ...
C. Li, J. M. van den Akker, Sjaak Brinkkemper, Gui...
—Scheduling and dispatching are two ways of solving production planning problems. In this work, based on preceding works, it is explained how these two approaches can be combined...
Andreas Beham, Stephan M. Winkler, Stefan Wagner 0...