Search
Now showing items 131-140 of 162
A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
(Algorithms, 2019)
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies ...
An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems
(Elsevier, 2021-06)
Distributed flow shop scheduling is a very interesting research topic. This paper studies the distributed permutation flow shop scheduling problem with mixed no-idle constraints, which have important applications in practice. ...
A green scheduling algorithm for the distributed flowshop problem
(Elsevier, 2021)
In recent years, sustainable development and green manufacturing have attracted widespread attention to environmental problems becoming increasingly serious. Meanwhile, affected by the intensification of market competition ...
Multi-zone optimisation of high-rise buildings using artificial intelligence for sustainable metropolises. Part 2: Optimisation problems, algorithms, results, and method validation
(Elsevier, 2021)
High-rise building optimisation is becoming increasingly relevant owing to global population growth and urbanisation trends. Previous studies have demonstrated the potential of high-rise optimisation but have been focused ...
Hospital layout design renovation as a Quadratic Assignment Problem with geodesic distances
(Elsevier, 2021)
Hospital facilities are known as functionally complex buildings. There are usually configurational problems that lead to inefficient transportation processes for patients, medical staff, and/or logistics of materials. The ...
Multi-zone optimisation of high-rise buildings using artificial intelligence for sustainable metropolises. Part 1: Background, methodology, setup, and machine learning results
(Elsevier, 2021)
Designing high-rise buildings is one of the complex tasks of architecture because it involves interdisciplinary performance aspects in the conceptual phase. The necessity for sustainable high-rise buildings has increased ...
A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion
(2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, 2010)
Very recently, Jarboui et al. [1] (Computers & Operations Research 36 (2009) 2638-2646) and Tseng and Lin [2] (European Journal of Operational Research 198 (2009) 84-92) presented a novel estimation distribution algorithm ...
A DE based variable iterated greedy algorithm for the no-idle permutation flowshop scheduling problem with total flowtime criterion
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)
In this paper, we present a variable iterated greedy (vIGP-DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the ...
A memetic algorithm with a variable block insertion heuristic for single machine total weighted tardiness problem with sequence dependent setup times
(2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)
In this paper, a memetic algorithm with a variable block insertion heuristic is presented to solve the single machine total weighted tardiness problem with sequence dependent setup times. Together with the traditional ...
A discrete artificial bee colony algorithm for the energy-efficient no-wait flowshop scheduling problem
(Procedia Manufacturing, 2019)
No-wait permutation flow shop scheduling problem (NWPFSP) is a variant of permutation flow shop scheduling problem (PFSP), where the processing of each job must be continuous from start to end without any interruption. ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
