Kharazmi University International Journal of Supply and Operations Management 2383-1359 1 1 2014 05 01 No-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods 54 68 1903 10.22034/2014.1.04 EN Bahman Naderi Department of Industrial Engineering, Faculty of Engineering, University of Kharazmi, Tehran, Iran Vahid Roshanaei Department of Industrial Engineering, University of Toronto, Toronto, Canada Journal Article 2014 07 17 In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming models. Since open shop scheduling problems are NP-hard, only small instances can be solved to optimality using these models. Thus, to solve large instances, two meta-heuristics based on simulated annealing and genetic algorithms are developed. A complete numerical experiment is conducted and the developed models and algorithms are compared. The results show that genetic algorithm outperforms simulated annealing. http://www.ijsom.com/article_1903_0d44b3dce86860e16d114195990edcfb.pdf