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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Industrial and Systems Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
