Abstract
This paper considers two‐machine open shop problems with secondary criteria where the primary criterion is the minimization of makespan and the secondary criterion is the minimization of the total flow time, total weighted flow time, or total weighted tardiness time. In view of the strongly NP‐hard nature of these problems, two polynomially solvable special cases are given and constructive heuristic algorithms based on insertion techniques are developed. A strongly connected neighborhood structure is derived and used to develop effective iterative heuristic algorithms by incorporating iterative improvement, simulated annealing and multi‐start procedures. The proposed insertion and iterative heuristic algorithms are empirically evaluated by solving problem instances with up to 80 jobs.
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: International Transactions in Operational Research
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.
