Dear users,
This is our new website
(we are launching the new one in order to improve our communication and provide better services to the editors and authors. So we will upload all data soon).


Please click here to visit our current website, and also to submit your paper
:
 
www.ijsom.com 


 Thanks for your patience during relocation.

Feel free to contact us via info@ijsom.com and ijsom.info@gmail.com

   [Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
:: Volume 1, Issue 1 (5-2014) ::
IJSOM 2014, 1(1): 54-68 Back to browse issues page
No-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods
Bahman Naderi * 1, Vahid Roshanaei 2
1- Department of Industrial Engineering, Faculty of Engineering, University of Kharazmi, Tehran, Iran , bahman_naderi62@yahoo.com
2- Department of Industrial Engineering, University of Toronto, Toronto, Canada
Abstract:   (3350 Views)
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.
Keywords: Scheduling, Open shop, No idle time, Mixed integer linear programming, Simulated Annealing, Genetic Algorithm
     
Type of Study: مقاله پژوهشی |
ePublished: 2017/09/28
Send email to the article author

Add your comments about this article
Your username or Email:

Write the security code in the box >


XML     Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Naderi B, Roshanaei V. No-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods. IJSOM. 2014; 1 (1) :54-68
URL: http://system.khu.ac.ir/ijsom/article-1-1903-en.html


Volume 1, Issue 1 (5-2014) Back to browse issues page
International Journal of Supply and Operations Management International Journal of Supply and Operations Management
Persian site map - English site map - Created in 5.98 seconds with 32 queries by YEKTAWEB 3647