Optimisation of Production Machine Scheduling Using a Two Level Mixed Optimisation Method
Commander Anil Rana, Ajit Verma, As Srividya (2010)
The Yugoslav Journal of Operations Research
Similarity:
Commander Anil Rana, Ajit Verma, As Srividya (2010)
The Yugoslav Journal of Operations Research
Similarity:
Jun-qing Li, Quan-ke Pan, Sheng-xian Xie (2010)
Computer Science and Information Systems
Similarity:
Jozef Kratica, Dušan Tošic, Vladimir Filipović, Ivana Ljubić (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.
Ewa Figielska (2009)
Control and Cybernetics
Similarity:
Jozef Kratica, Dušan Tošić, Vladimir Filipović, Đorđe Dugošija (2011)
The Yugoslav Journal of Operations Research
Similarity:
Djamel Berkoune, Khaled Mesghouni, Besoa Rabenasolo (2006)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use genetic algorithms for the optimisation of this type of problems. The list of the demands is divided in two sets: the actual demand, which is considered as certain (a list of jobs with known characteristics), and the predicted demand, which is a list of uncertain...
Belkadi, K., Gourgand, M., Benyettou, M. (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Chen, Ruey-Maw, Wang, Chuin-Mu (2011)
Abstract and Applied Analysis
Similarity:
Petr Fiala (1997)
Kybernetika
Similarity:
R. Tadei, F. Della Croce, G. Menga (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: