Abstract:
Grouping jobs or operations into larger collections
called batches is often found in many types of
production environment. In this talk we will consider
multi-stage scheduling models such as flow shop,
job shop and open shop under various assumptions
on the nature of batching. Mainly, the models with Batch
Availability Rule will be addressed. This rule determines
the operations in a batch are considered completed
and available for further processing if the whole batch
is finished. We will discuss two types of the rules that
determine the length of a batch: (a) the length of a batch
is equal to the sum of durations of its operations; and
(b) the length of a batch is equal to the maximum
duration of its operations. For relevant models we give
insights of polynomial-time algorithms and computational
complexity, and also analyze approximation algorithms.
Lehrstuhl fuer Informations- und
Technologiemanagement
Prof. Guenter Schmidt