Abstract
The distribution of energy is central to the needs of our society. The complexity of the tasks associated with maintaining energy distribution networks has increased exponentially with the introduction of renewable energy sources in large numbers. This paper proposes a novel approach for automatic optimization and scheduling of the workflows for energy distribution. The generated workflows replace manual scheduling of maintenance activities and consist of a set of inter-dependent tasks that have to be carried out by teams of engineers at different sites distributed across cities and even regions. Our algorithm is able to satisfy the dependencies between tasks and schedules these dependency based workflows by combining and extending on Job-Shop Scheduling and Traveling Salesman approaches. It minimizes the makespan of the workflows as well as the time teams travel to the various locations. The proposed approach has been assessed on different problem sizes and configurations based on data derived from real maintenance scenarios. Results show that high quality optimal solutions can be achieved for up to 21 sites within an hour.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
1. Bektas, T.: The Multiple Traveling Salesman Problem: An Overview of Formulations and Solution Procedures. Omega 34(3), 209–219 (2006)
2. Chen, J.S., Yan, J.S.: Model Formulations for the Machine Scheduling Problem with Limited Waiting Time Constraints. Journal of Information & Optimization Sciences 27(1), 225–240 (2006)
3. Gurobi Optimization, I.: Gurobi Optimizer Reference Manual (2017), http://www.gurobi.com
4. Jain, A.S., Meeran, S.: Deterministic Job-Shop Scheduling: Past, Present and Future. Operational Research 113(2), 390–434 (1998)
5. Kara, I., Derya, T.: Formulations for Minimizing Tour Duration of the Traveling Salesman Problem with Time Windows. In: Procedia Economics and Finance. vol. 26, pp. 1026–1034 (2015)
6. Kek, A.G., Cheu, R.L., Meng, Q.: Distance-Constrained Capacitated Vehicle Routing Problems with Flexible Assignment of Start and End Depots. Mathematical and Computer Modelling 47(1), 140–152 (2008)
7. Laporte, G., Nobert, Y.: A Cutting Planes Algorithm for the m-Salesmen Problem. Journal of the Operational Research Society 31(11), 1017–1023 (1980)
8. Lawler, E.L., Lenstra, J.K., Kan, A.H.R., Shmoys, D.B.: Sequencing and Scheduling: Algorithms and Complexity. Handbooks in Operations Research and Management Science 4, 445–522 (1993)
9. Lee, C.Y., Lei, L., Pinedo, M.: Current Trends in Deterministic Scheduling. Annals of Operations Research 70(0), 1–41 (1997)
10. Manne, A.S.: On the Job-Shop Scheduling Problem. Operations Research 8(2), 219–223 (1960)
11. Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer Programming Formulation of Traveling Salesman Problems. Journal of the ACM 7(4), 326–329 (1960)
12. Özgüven, C., Özbakr, L., Yavuz, Y.: Mathematical Models for Job-Shop Scheduling Problems with Routing and Process Plan Flexibility. Applied Mathematical Modelling 34(6), 1539–1548 (2010)
13. Ronconi, D.P., Birgin, E.G.: Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness, vol. 60, pp. 91–105. Springer (2011)
14. Shapiro, J.F.: Handbooks in Operations Research and Management Science, vol. 4, chap. Mathematical Programming Models and Methods for Production Planning and Scheduling, pp. 371–443. Elsevier (1993)
15. Taş, D., Gendreaub, M., Jabalic, O., Laporte, G.: The Traveling Salesman Problem with Time-Dependent Service Times. European Journal of Operational Research 248(2), 372–383 (2016)
16. Šeda, M.: Mathematical Models of Flow Shop and Job Shop Scheduling Problems. International Journal of Applied Mathematics and Computer Sciences 4(4), 241–246 (2007)
Acknowledgments
This work was funded in part by the Swiss Commission for Technology and Innovation (CTI). The authors would also like to thank IDS Switzerland AG for their support and for providing the data that made this work possible.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Majeed, T., Handschuh, M., Meier, R. (2018). Automatic Scheduling of Dependency-Based Workflows. In: Omatu, S., Rodríguez, S., Villarrubia, G., Faria, P., Sitek, P., Prieto, J. (eds) Distributed Computing and Artificial Intelligence, 14th International Conference. DCAI 2017. Advances in Intelligent Systems and Computing, vol 620. Springer, Cham. https://doi.org/10.1007/978-3-319-62410-5_38
Download citation
DOI: https://doi.org/10.1007/978-3-319-62410-5_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62409-9
Online ISBN: 978-3-319-62410-5
eBook Packages: EngineeringEngineering (R0)