Abstract
Previously, minimizing total flow time in the model of an identical, parallel machines with nonpreemptive jobs has been investigated. Because the specific problem has been shown as NP-complete, heuristics have been developed for solving it. A shortest processing time for Ai part (SPT-A) heuristic is used for the job scheduling subproblem. In addition, the largest marginal contribution (LMC) procedure is used for the worker assignment subproblem and then minimizes the total flow time. Different values of W (number of workers) are used for further study of the performance of these heuristics developed. In conclusion, for the simplified processing time function, values of W have no significant influence when the heuristics are applied. In other words, no matter what value of W was used when SPT rule was applied, the heuristics generate the same, excellent results.
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: The International Journal of Advanced Manufacturing Technology
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.
