Online scheduling of flexible job-shops with blocking and transportation

Autor(en): Poppenborg, Jens
Knust, Sigrid 
Hertzberg, Joachim 
Stichwörter: AGV; automated guided vehicle; AUTOMATED GUIDED VEHICLES; blocking; CONSTRAINTS; Engineering; Engineering, Industrial; flexible job-shop; GENETIC ALGORITHM; MACHINES; online scheduling; Operations Research & Management Science; scheduling; SYSTEM; total weighted tardiness
Erscheinungsdatum: 2012
Herausgeber: INDERSCIENCE ENTERPRISES LTD
Journal: EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING
Volumen: 6
Ausgabe: 4
Startseite: 497
Seitenende: 518
Zusammenfassung: 
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]
ISSN: 17515254
DOI: 10.1504/EJIE.2012.047662

Show full item record

Google ScholarTM

Check

Altmetric