Abstract
This paper deals with scheduling for single machine batch processing, specifically the transporting problem with one vehicle. Capacity restrictions of the machine are considered and the main objective is to find an assignment of jobs to achieve the minimal processing time of all batches, given these capacities. A polynomial algorithm is proposed for solving the case in which the jobs are non-preemptive, non-identical, and are known before the realization of the schedule. The proposed algorithm is implemented and shown to yield better results than alternatives from the literature.
Keywords
Cite this article
@article{cai-1546,
author = {Thanh-Tung Dang and Baltazár Frankovič and Ivana Budinská and Ben Flood and Con Sheahan and Bao-Lam Dang},
title = {Using Heuristic Search for Solving Single Machine Batch Processing Problems},
journal = {Computing and Informatics},
volume = {25},
number = {5},
pages = {405--420},
year = {2006},
issn = {1335-9150},
url = {https://cai.type.sk/content/2006/5/using-heuristic-search-for-solving-single-machine-batch-processing-problems/}
}
TY - JOUR AU - Thanh-Tung Dang AU - Baltazár Frankovič AU - Ivana Budinská AU - Ben Flood AU - Con Sheahan AU - Bao-Lam Dang TI - Using Heuristic Search for Solving Single Machine Batch Processing Problems JO - Computing and Informatics VL - 25 IS - 5 SP - 405 EP - 420 PY - 2006 SN - 1335-9150 UR - https://cai.type.sk/content/2006/5/using-heuristic-search-for-solving-single-machine-batch-processing-problems/ KW - Scheduling KW - batch-processing KW - optimization KW - heuristic search ER -
Dang, T., Frankovič, B., Budinská, I., Flood, B., Sheahan, C., & Dang, B. (2006). Using Heuristic Search for Solving Single Machine Batch Processing Problems. Computing and Informatics, 25(5), 405–420. https://cai.type.sk/content/2006/5/using-heuristic-search-for-solving-single-machine-batch-processing-problems/