MIP formulations and heuristics for solving parallel batching problems

Abstract

This paper addresses the scheduling problem involving batch processing machines, which is also known as parallel batching in the literature. The presented mixed integer programming formulation first provides an elegant model for the problem under study. Furthermore, it enables solutions to the problem instances beyond the capability of exact methods developed so far. In order to alleviate computational burden, the authors propose MIP-based heuristic approaches which balance solution quality and computing time.

Scheduling a Proportionate Flow Shop of Batching Machines

“…Some mixed-integer programs have been proposed for this purpose, e.g. by Buscher and Shen [BS10]. Ikura and Gimple [IG86] consider the case of a single batching machine with consistent release and due dates and identical processing times.…”

“…This chapter deals with mixed-integer programming (MIP) formulations for scheduling a PFB. Buscher and Shen [BS10] propose mixed-integer programs for flow shops with parallel batching. Their setting does not require job-independent processing times and differs in some other details from our PFB.…”

“…Buscher and Shen [BS10] give two formulations for a non-proportionate flow shop of batching machines, i.e. processing times may be job-dependent.…”