<abstract xmlns="http://www.w3.org/1999/xhtml"><p>We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage. We assume identical jobs, and the option of batching, with a required setup time prior to the processing of a new batch. We also consider the option to use only a subset of the available machines. The objective is minimum makespan. A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule. The running time of our proposed solution algorithm is independent of the number of jobs, and linear in the number of machines</p></abstract>

We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage. We assume identical jobs, and the option of batching, with a required setup time prior to the processing of a new batch. We also consider the option to use only a subset of the available machines. The objective is minimum makespan. A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule. The running time of our proposed solution algorithm is independent of the number of jobs, and linear in the number of machines

Batch Scheduling In A Two-Stage Flexible Flow Shop Problem

School of Business Administration, The Hebrew University,Jerusalem, Israel

The Center for Academics Studies, Or Yehuda, Israel

Foundations of Computing and Decision Sciences

{"article-title":"Batch Scheduling In A Two-Stage Flexible Flow Shop Problem"}

We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second...

Batch Scheduling In A Two-Stage Flexible Flow Shop Problem

Online veröffentlicht: 11. März 2014

Seitenbereich: 3 - 16

DOI: https://doi.org/10.2478/fcds-2014-0001

This content is open access.