hrcak mascot   Srce   HID

Croatian Operational Research Review, Vol. 7 No. 2, 2016

Original scientific paper
https://doi.org/10.17535/crorr.2016.0020

Heuristics for batching and sequencing in batch processing machines

Chuda Basnet   ORCID icon orcid.org/0000-0001-5011-2690 ; Department of Management Systems, Waikato Management School, The University of Waikato, Private Bag 3105, Hamilton, New Zealand

Fulltext: english, pdf (169 KB) pages 291-302 downloads: 246* cite
APA 6th Edition
Basnet, C. (2016). Heuristics for batching and sequencing in batch processing machines. Croatian Operational Research Review, 7 (2), 291-302. https://doi.org/10.17535/crorr.2016.0020
MLA 8th Edition
Basnet, Chuda. "Heuristics for batching and sequencing in batch processing machines." Croatian Operational Research Review, vol. 7, no. 2, 2016, pp. 291-302. https://doi.org/10.17535/crorr.2016.0020. Accessed 20 Apr. 2019.
Chicago 17th Edition
Basnet, Chuda. "Heuristics for batching and sequencing in batch processing machines." Croatian Operational Research Review 7, no. 2 (2016): 291-302. https://doi.org/10.17535/crorr.2016.0020
Harvard
Basnet, C. (2016). 'Heuristics for batching and sequencing in batch processing machines', Croatian Operational Research Review, 7(2), pp. 291-302. doi: https://doi.org/10.17535/crorr.2016.0020
Vancouver
Basnet C. Heuristics for batching and sequencing in batch processing machines. Croatian Operational Research Review [Internet]. 2016 [cited 2019 April 20];7(2):291-302. doi: https://doi.org/10.17535/crorr.2016.0020
IEEE
C. Basnet, "Heuristics for batching and sequencing in batch processing machines", Croatian Operational Research Review, vol.7, no. 2, pp. 291-302, 2016. [Online]. doi: https://doi.org/10.17535/crorr.2016.0020

Abstracts
In this paper, we discuss the “batch processing” problem, where there are multiple jobs to be processed in flow shops. These jobs can however be formed into batches and the number of jobs in a batch is limited by the capacity of the processing machines to accommodate the jobs. The processing time required by a batch in a machine is determined by the greatest processing time of the jobs included in the batch. Thus, the batch processing problem is a mix of batching and sequencing – the jobs need to be grouped into distinct batches, the batches then need to be sequenced through the flow shop. We apply certain newly developed heuristics to the problem and present computational results. The contributions of this paper are deriving a lower bound, and the heuristics developed and tested in this paper.

Keywords
batch processing; permutation flow-shop; heuristic algorithms; environmental stress testing

Hrčak ID: 174208

URI
https://hrcak.srce.hr/174208

Visits: 348 *