Abstract
Purpose This research deals with a scheduling problem that minimizes weighted sum of earliness and tardiness penalties in a single setup-operator and non-identical parallel machine system. Methods We first present a mixed integer linear programming formulation for the problem, and then, show the optimal solutions for relatively small problems can be easily found with the model and a commercial optimization software. However, since the problem is NP-hard and the size of a real problem can be large, we propose three heuristic algorithms including genetic algorithm to solve the practical big-size problems in a reasonable computational time. Results Through the computational experiments we found the heuristic algorithms show very good performances for the practical big-size problems. Conclusion The heuristic procedures proposed in this study can easily be used in the real situations.
Sign-in/Register to access full text options 
Free) 
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 call
