Advertisement
Published in:
2012 | OriginalPaper | Chapter
Integrated scheduling and location problems
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
As a second application of geometric branch-and-bound methods we present an integrated scheduling and location problem, namely the ScheLoc makespan problem. ScheLoc problems are location problems where we want to find an optimal location as well as an optimal schedule in an integrated model. Therefore, geometric branch-and-bound methods with mixed continuous and combinatorial variables are appropriate solution techniques for ScheLoc problems. In Section 8.1, we give a short introduction to ScheLoc problems before the ScheLoc makespan problem is presented explicitly in Section 8.2. In the following Sections 8.3 and 8.4, we show how to calculate lower bounds on the objective function as well as finite dominating sets for the combinatorial variables as required throughout the algorithm if we want to find an exact optimal solution. Some numerical experiences with comparisons to results reported in the literature are given in Section 8.5 before the chapter ends with a brief discussion in Section 8.6.