Variable Neighbourhood Search Solving Sub-problems of a Lagrangian Flexible Scheduling Problem

Alexander Hämmerle, Georg Weichhart

Abstract

New technologies allow the production of goods to be geographically distributed across multiple job shops. When optimising schedules of production jobs in such networks, transportation times between job shops and machines can not be neglected but must be taken into account. We have researched a mathematical formulation and implementation for flexible job shop scheduling problems, minimising total weighted tardiness, and considering transportation times between machines. Based on a time-indexed problem formulation, we apply Lagrangian relaxation, and the scheduling problem is decomposed into independent job-level sub-problems. This results in multiple single job problems to be solved. For this problem, we describe a variable neighbourhood search algorithm, efficiently solving a single flexible job (sub-)problem with many timeslots. The Lagrangian dual problem is solved with a surrogate subgradient search method aggregating the partial solutions. The performance of surrogate subgradient search with VNS is compared with a combination of dynamic programming solving sub-problems, and a standard subgradient search for the overall problem. The algorithms are benchmarked with published problem instances for flexible job shop scheduling. Based on these instances we present novel problem instances for flexible job shop scheduling with transportation times between machines, and lower and upper bounds on total weighted tardiness are calculated for these instances.

References

  1. Baptiste, P., Flamini, M., and Sourd, F. (2008). Lagrangian bounds for just-in-time job-shop scheduling. Computers & Operations Research, 35(3):906-915.
  2. Bragin, M. A., Luh, P. B., Yan, J. H., Yu, N., and Stern, G. A. (2014). Convergence of the Surrogate Lagrangian Relaxation Method. Journal of Optimization Theory and Applications, 164(1):173-201.
  3. Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41(3):157-183.
  4. Buil, R., Piera, M. A., and Luh, P. B. (2012). Improvement of lagrangian relaxation convergence for production scheduling. Automation Science and Engineering, IEEE Transactions on, 9(1):137-147.
  5. Chen, H., Chu, C., and Proth, J.-M. (1998). An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming method. Robotics and Automation, IEEE Transactions on, 14(5):786-795.
  6. Chen, H. and Luh, P. B. (2003). An alternative framework to Lagrangian relaxation approach for job shop scheduling. European Journal of Operational Research, 149(3):499-512.
  7. Hoitomt, D. J., Luh, P. B., and Pattipati, K. R. (1993). A practical approach to job-shop scheduling problems. Robotics and Automation, IEEE Transactions on, 9(1):1-13.
  8. Kaskavelis, C. A. and Caramanis, M. C. (1998). Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems. IIE transactions, 30(11):1085-1097.
  9. Sobeyko, O. and M önch, L. (2015). Heuristic Approaches for Scheduling Jobs in Large-scale Flexible Job Shops. Computers & Operations Research. accepted for publication.
  10. Wang, J., Luh, P. B., Zhao, X., and Wang, J. (1997). An optimization-based algorithm for job shop scheduling. Sadhana, 22(2):241-256.
Download


Paper Citation


in Harvard Style

Hämmerle A. and Weichhart G. (2017). Variable Neighbourhood Search Solving Sub-problems of a Lagrangian Flexible Scheduling Problem . In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-218-9, pages 234-241. DOI: 10.5220/0006114102340241


in Bibtex Style

@conference{icores17,
author={Alexander Hämmerle and Georg Weichhart},
title={Variable Neighbourhood Search Solving Sub-problems of a Lagrangian Flexible Scheduling Problem},
booktitle={Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2017},
pages={234-241},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006114102340241},
isbn={978-989-758-218-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Variable Neighbourhood Search Solving Sub-problems of a Lagrangian Flexible Scheduling Problem
SN - 978-989-758-218-9
AU - Hämmerle A.
AU - Weichhart G.
PY - 2017
SP - 234
EP - 241
DO - 10.5220/0006114102340241