A hybrid coding SA method for multi-item capacity-constrained production and delivery scheduling problem with arbitrary job volumes and customer inventory considerations Online publication date: Mon, 30-Nov-2015
by De-Yun Wang; Olivier Grunder; Ke-Jun Zhu
International Journal of Industrial and Systems Engineering (IJISE), Vol. 22, No. 1, 2016
Abstract: This article deals with an integrated scheduling problem for a multi-item capacity-constrained production and delivery system. The compatible jobs are firstly processed on a batching machine, and then delivered to a customer by one capacitated transporter. Each job has to be delivered to the customer before its due date. It is assumed that the job which arrives to the customer before its due date will occur an earliness penalty. The problem is to find an integrated schedule such that the total logistics cost is minimised while guaranteeing a certain customer service level. We formulate the problem as a nonlinear model, and show that this problem is intractable. Then we develop a hybrid-coding simulated annealing algorithm for solving the problem. At last, we derive a lower bound to verify performance of this proposed algorithm. Experiments show the efficiency in terms of both solution quality and running time of the proposed algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook