Abstract
In this paper, production scheduling for rotomoulded plastics manufacturing in a multi-machine environment is considered. The objective is to minimise total tardiness. The problem has some commonality with hybrid flow shop scheduling with batching, where additional constraints are needed to control which machines may be used at each stage. The problem is shown to be NP-hard and is formulated as a mixed integer program. Given consequently large solve times to obtain optimal solutions, simulated annealing and tabu search algorithms were developed alongside a constructive heuristic to obtain near-optimal solutions within a practical time-frame. The solution algorithms were tuned and tested using randomly generated problem instances. The best results in terms of solution quality were generally obtained by simulated annealing. The problem instances were generated to be representative of a real production environment located in Queensland, Australia.
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.
