International Transactions in Operational Research

A hybrid neural network approach to minimize total completion time on a single batch processing machine

Early View

Abstract In this research, the problem of scheduling a single batch processing machine (BPM) with nonidentical job sizes is considered. The objective is to minimize the total completion time of the jobs. A BPM can process a group of jobs simultaneously as a batch as long as its capacity is not violated. The processing time of a batch is equal to the maximum processing time of all the jobs in the batch. The research problem is formulated as a mixed integer linear programming model. Since the problem under study is shown to be NP‐hard, a neural network based approach that combines a heuristic algorithm and the iterative learning approach is proposed. The computational experiments are designed to compare the effectiveness of the neural network approach with CPLEX and the other available heuristics in the literature. The results show that the proposed approach outperforms the other algorithms in terms of solution quality.

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.