期刊名称：International Journal of Industrial Engineering Computations
印刷版ISSN：1923-2926
电子版ISSN：1923-2934
出版年度：2011
卷号：2
期号：3
页码：491-498
DOI：10.5267/j.ijiec.2011.04.003
语种：English
出版社：Growing Science Publishing Company
摘要：This study investigates minimizing the number of weighted tardy jobs on a single machine when jobs are delivered to either customers or next station in various size batches. In real world, this issue may happen within a supply chain in which delivering goods to customers entails costs. Under such circumstances, keeping completed jobs to deliver in batches may result in reducing delivery costs; nevertheless, it may add to the tardy jobs, which in turn leads to higher costs. In literature review, minimizing the number of weighted tardy jobs is known as NP-Hard problem, so the present issue aiming at minimizing the costs of delivering, in addition to the aforementioned objective function, remains an NP-Hard problem. In this study, the issue is assessed where the customers are numerous, and a mathematical model is presented. We also present a meta-heuristic method based on simulated annealing (SA) and the performance of the SA is examined versus exact solutions.
