Meta-heuristics to solve single-machine scheduling problem with sequence-dependent setup time and deteriorating jobs

Bahalke, Unes; Yolmeh, Abdolmajid; Shahanaghi, Kamran

doi:10.1007/s00170-010-2526-5

Cited by 25 publications

(11 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Applying this method has resulted in good outputs in both references [35] and [36]; the complete procedure of this technique is described in reference [35]. In the present paper, due to the implementation of the restart scheme after 20 consequent repetitions of the same result (experimentally, this value was selected powerfully because of the significant good results), the best chromosomes of the current population are transferred to next generation directly and the remaining population is replaced with feasible randomly generated chromosomes.…”

Section: Degamentioning

confidence: 98%

Formulation and heuristic algorithm for flow time minimization in a simple assembly line

Bahalke

Dolatkhahi

Dehghani

et al. 2011

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

Assembly lines are special flow-line production systems which are of great importance in industrial mass production. Since the flow time of a product in most industrial foundries dealing with heating products is important because of its cost, the present paper introduces the effect of task deterioration into the total flow time of a product in each production cycle of an assembly line. Task deterioration means that a task processed later consumes more time than the same task when it is processed earlier. This issue is considered in a simple assembly line balancing (SALB) problem, where the aim is to find an optimal schedule of tasks in the workstations so as to minimize total flow time of a product considering the desired cycle time. For this aim a mathematical model is proposed and, according to complexity of the considered problem, a heuristic algorithm is introduced to minimize the flow time objective function which is named as FTALB. Finally, several well-known examples are solved and comparisons are done with the popular genetic algorithm and tabu search meta-heuristics. The results show the effectiveness of the proposed FTALB heuristic algorithm in terms of both the quality of the solutions and the computational time, which is almost zero in all scales of instances.

show abstract

Section: Degamentioning

confidence: 98%

Formulation and heuristic algorithm for flow time minimization in a simple assembly line

Bahalke

Dolatkhahi

Dehghani

et al. 2011

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

show abstract

“…Various GA operators such as crossover, reproduction, mutation, etc. are utilized to get next generation of solutions [10]. This process is iterated till predefined number of iteration is reached or the optimum result is obtained or there is no improvement in the fitness of the population over a prescribed amount of iterations.…”

Section: Fig 3 Effect Of Data Polarity ( ) Parameter On the Processmentioning

confidence: 99%

Imperceptible Steganography Scheme with High Payload Capacity using Genetic Algorithm and Particle Swarm Optimization

Shah*,

Bichkar

2019

IJEAT

View full text Add to dashboard Cite

 Abstract: Security is the most significant parameter in all type of confidential data transfers. Steganography is used to enhance the security of such confidential communications. Steganography is a method of covert communication in which the existence of secrecy is concealed. In image steganography, achieving high data embedding capacity and simultaneously retaining good visual quality is a very tricky and difficult objective. In this paper, a reversible, secure, extremely imperceptible and high payload capacity steganography technique in the spatial domain is proposed. The proposed method employs evolutionary computation techniques to identify the most optimum locations and arrangements for secret data embedding. The proposed technique uses Particle Swarm Optimization to find the best possible order of data hiding whereas Genetic algorithm is used to identify the best possible arrangements to modify secret data to produce least amount of change in cover-image. The result of the proposed scheme is compared with many steganography techniques and the proposed scheme outperforms the existing schemes in terms of imperceptibility. The proposed technique produces an average PSNR value of 46.40 dB at 2 bit per pixel data embedding rate.

show abstract

“…where j w is the computational value at the node of j-th probe obtained from Eq (1). The optimal algorithm [6][7][8][9][10] is needed to determine the correction coefficients. The flow chart of PSO is shown in Figure 1.…”

Section: Modified Gauss Weighting Interpolation Algorithmmentioning

confidence: 99%

Research of Imaging Interpretation Model of CAT Logging Data

Yong¹,

Li²

2016

IJHT

View full text Add to dashboard Cite

The capacitance array tool (CAT) uses twelve probes distributed symmetrically to measure the response at different azimuths in the wellbore. It is especially suitable to measure highly-deviated wells and horizontal wells, and can intuitively reflect the phase distribution of fluid in the wellbore to image the logging information. This paper considers the dynamic subdivision of instrument rotation, and an imaging algorithm based on the modified Gaussian weighting function is proposed. This algorithm uses different parameters, vertically and horizontally, to adapt to the stratification phenomenon of fluid. In order to improve adaptability, the algorithm introduces the correction coefficient which is determined by using optimization. The results show that the imaging effect coincides well with the corresponding photographs.

show abstract

Meta-heuristics to solve single-machine scheduling problem with sequence-dependent setup time and deteriorating jobs

Cited by 25 publications

References 22 publications

Formulation and heuristic algorithm for flow time minimization in a simple assembly line

Formulation and heuristic algorithm for flow time minimization in a simple assembly line

Imperceptible Steganography Scheme with High Payload Capacity using Genetic Algorithm and Particle Swarm Optimization

Research of Imaging Interpretation Model of CAT Logging Data

Contact Info

Product

Resources

About