Application of hybrid GA-SA heuristics for single-job production-delivery scheduling problem with inventory and due date considerations Online publication date: Sat, 20-Dec-2014
by Ke-Jun Zhu; De-Yun Wang
International Journal of Industrial and Systems Engineering (IJISE), Vol. 12, No. 3, 2012
Abstract: This paper studies a production scheduling problem with delivery considerations in which a set of identical jobs are batch processed on a machine and then, finished jobs need to be delivered to a customer by a capacitated vehicle. Particularly, we assume the existence in production stage of an inventory which works as a buffer to balance the abilities of the two logistical stages. The objective is to find a joint schedule such that the sum of setup, production, delivery and inventory cost is minimised. We formulate the problem as a mixed integer programming model and propose four heuristic algorithms, such as genetic algorithm (GA), simulated annealing (SA), hybrid GA-SA (HGASA) and hybrid SA-GA (HSAGA), for solving it. To evaluate the proposed heuristics, we propose a lower bound by Lagrangian relaxation method. Computational experiments show that the proposed HGASA and HSAGA are efficient on randomly generated problem instances, and perform better than the simple heuristics, GA and SA.
Online publication date: Sat, 20-Dec-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com