Abstract
This paper proposes an effective and efficient mixed integer linear programming (MIP) formulation of the unrelated parallel machine scheduling problem with the objective of minimising total earliness and tardiness (ET) and explores how scheduling performance can be improved by allowing machine idle time. In addition, four simple dispatching rules are utilised to improve solution efficiency. From the results of experiments, it is found that: 1) the improved MIP formulation fixes a potential problem of existing models in literature; 2) the ET value can be significantly reduced if machine idle time is properly allowed before jobs; 3) the utilised dispatching rules yield comparable efficient and quality solutions.
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 Manufacturing Technology and Management
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.
