Affordable Access

Batch machine production with perishability time windows and limited batch size

Authors
Disciplines
  • Biology
  • Medicine

Abstract

This article provides a theoretical analysis of the problem of scheduling jobs in batches by family on a batch-processing machine, in the presence of perishability time windows of equal length. The problem arises in the context of production planning in a microbiological laboratory, and has application in wafer-fab production and for wireless broadcasting. The combined features of multiple families and time windows are new to the literature. The study is restricted to unit job processing times. We prove that the problem is NP-hard, thus solving an open problem by Uzsoy [24]. A Dynamic Programme is developed, with running time polynomial in the input variables of maximum batch size, the number of families and the length of the demand time horizon. In addition, we show that an heuristic approach to minimising the perishability time window can provide a 2-approximation to the optimum.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Batch machine production with perishability time w...

on European Journal of Operationa... Jan 01, 2011

Minimizing makespan on a single batching machine w...

on Operations Research Letters Jan 01, 2005

Minimizing flow-time on a single machine with inte...

on Operations Research Letters Jan 01, 2005

Minimizing mean flow times criteria on a single ba...

on International Journal of Produ... Jan 01, 1998
More articles like this..