Journal
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING
Volume 6, Issue 4, Pages 497-518Publisher
INDERSCIENCE ENTERPRISES LTD
DOI: 10.1504/EJIE.2012.047662
Keywords
scheduling; online scheduling; flexible job-shop; automated guided vehicle; AGV; blocking; total weighted tardiness
Ask authors/readers for more resources
This paper deals with online scheduling of a flexible job-shop with blocking where jobs are transported between the machines by one or several automated guided vehicles. The objective is to minimise the total weighted tardiness of the jobs. Schedules have to be generated online (i.e., jobs only become known to the scheduler at their respective release dates) as well as in real time (i.e., only a limited amount of computation time is allowed). We propose a MIP formulation for the offline situation and an online Tabu search algorithm that decomposes the problem into an assignment and a scheduling subproblem. In some computational experiments online and offline algorithms are compared for various problem instances. [Received 17 May 2010; Revised 24 November 2010; Accepted 24 February 2011]
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available