Online scheduling of flexible job-shops with blocking and transportation
by Jens Poppenborg; Sigrid Knust; Joachim Hertzberg
European J. of Industrial Engineering (EJIE), Vol. 6, No. 4, 2012

Abstract: 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]

Online publication date: Wed, 10-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email