Abstract
This study examined together machine scheduling and finished–product batch delivery. Particularly, this study considered all jobs required different storage space during delivery. Three single–machine scheduling models are developed that considered transportation time of a single delivery vehicle serving one customer area. Two of the models considered release time, the other does not. All models are developed using integer programming to optimally solve the problem. In doing so, total tradiness is minimized. The problem is NP–hard in the strong sense in general. The results of a computational experiment were reported as well.
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 callDisclaimer: 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.
