loading
Documents

Research.Publish.Connect.

Paper

Authors: Alexander Hämmerle 1 and Georg Weichhart 2

Affiliations: 1 Profactor GmbH, Austria ; 2 Profactor GmbH and Johannes Kepler University, Austria

ISBN: 978-989-758-218-9

Keyword(s): Flexible Job Shop Scheduling, Lagrangian Relaxation, Subgradient Search, Variable Neighbourhood Search

Related Ontology Subjects/Areas/Topics: Applications ; Artificial Intelligence ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Methodologies and Technologies ; Operational Research ; Optimization ; Pattern Recognition ; Scheduling ; Software Engineering ; Symbolic Systems

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. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.80.68.137

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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

@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},
}

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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.