Abstract

In this paper, we discuss a two-stage flow shop scheduling problem with batch processing machines. The jobs belong to different incompatible job families. Only jobs of the same job family can be batched together. The performance measure is the total weighted tardiness of the jobs. A decomposition heuristic is proposed that is based on the idea to iteratively determine due dates for the jobs in the first stage and earliest start dates of the jobs in the second stage. The two resulting subproblems are solved using a time window decomposition (TWD) heuristic and a variable neighborhood search (VNS) scheme. Results of computational experiments based on randomly generated problem instances are presented. We show that the VNS-based scheme outperforms the TWD heuristic. In addition, we show that the decomposition scheme can be parallelized in a very natural way. As a result, the amount of computing time is modest, even for the computational expensive VNS scheme.

Original languageEnglish (US)
Title of host publicationProceedings of the 2014 Winter Simulation Conference, WSC 2014
EditorsAndreas Tolk, Levent Yilmaz, Saikou Y. Diallo, Ilya O. Ryzhov
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2490-2501
Number of pages12
ISBN (Electronic)9781479974863
DOIs
StatePublished - Jan 23 2015
Event2014 Winter Simulation Conference, WSC 2014 - Savannah, United States
Duration: Dec 7 2014Dec 10 2014

Publication series

NameProceedings - Winter Simulation Conference
Volume2015-January
ISSN (Print)0891-7736

Other

Other2014 Winter Simulation Conference, WSC 2014
CountryUnited States
CitySavannah
Period12/7/1412/10/14

ASJC Scopus subject areas

  • Software
  • Modeling and Simulation
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Decomposition heuristic for a two-machine flow shop with batch processing'. Together they form a unique fingerprint.

Cite this