Scheduling flowshops with condition-based maintenance constraint to minimize expected makespan

Safari, Ehram; Sadjadi, Seyed Jafar; Shahanaghi, Kamran

doi:10.1007/s00170-009-2151-3

Cited by 34 publications

(10 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section is provided for comparison the results of the proposed algorithm with those of the existing metaheuristics such as GA and SA. Further information about GA and SA can be found in references [55][56][57][58][59][60][61][62]. Examples 1 to 11 can be first modelled by the discretized model described in Section 2.3 and then solved by the existing solvers for GA and SA in MATLAB.…”

Section: Comparison the Proposed Algorithm With Ga And Samentioning

confidence: 99%

Dynamic Pricing of a Web Service in an Advance Selling Environment

Safari

Babakhani

Sadjadi

et al. 2015

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

Consider a web service with different quality of service levels where users may purchase their required web service through a reservation system. The service provider adjusts prices of web service classes over a prespecified time horizon to manage demand and maximize profit. Users may cancel their services as long as they pay a penalty. One of the important challenges for service providers is capacity limitation of the resources employed in offering the web service. Thus, taking this important proposition into account makes pricing strategies considered by the provider has more credit. Another important factor in determining pricing strategies discussed in the present paper is the market influence which can increase or decrease the price that the provider offers. This paper develops a continuous time optimal control model for identifying pricing strategies for the web service classes. We study the optimality condition of the considered model based on maximum principal and propose an algorithm to obtain the optimal pricing policy. Moreover, we perform numerical analyses to evaluate the effect of some parameters on control and state variables and objective function. In addition, we compare the proposed algorithm with genetic algorithm (GA) and simulated annealing (SA) available in Matlab.

show abstract

Section: Comparison the Proposed Algorithm With Ga And Samentioning

confidence: 99%

Dynamic Pricing of a Web Service in an Advance Selling Environment

Safari

Babakhani

Sadjadi

et al. 2015

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…They proposed three heuristics and two metaheuristics to tackle the problem. Safari et al (2010Safari et al ( , 2011 considered the flowshop problem where machines are subject to condition based maintenance. They provided two hybrid meta-heuristic algorithms to tackle the NP-hardness of the problem.…”

Section: Introductionmentioning

confidence: 99%

Integrating the sequence dependent setup time open shop problem and preventive maintenance policies

Naboureh¹,

Safari²

2016

10.5267/j.dsl

View full text Add to dashboard Cite

“…Algorithms such as genetic algorithm (GA), simulated annealing (SA), tabu search (TS), ant colony (ACO), artificial immune system (AIS), and etc. are meta-heuristic methods to optimize real problems [2][3][4][5].…”

Section: Introductionmentioning

confidence: 99%

A novel algorithm based on hybridization of artificial immune system and simulated annealing for clustering problem

Abdi

Fathian

Safari

2011

Int J Adv Manuf Technol

Self Cite

View full text Add to dashboard Cite

A hybrid clustering method is proposed in this paper based on artificial immune system and simulated annealing. An integration of simulated annealing and immunity-based algorithm, combining the merits of both these approaches, is used for developing an efficient clustering method. Tuning the parameters of method is investigated using Taguchi method in order to select the optimum levels of parameters. Proposed method is implemented and tested on three real datasets. In addition, its performance is compared with other well-known metaheuristics methods, such as ant colony optimization, genetic algorithm, simulated annealing, Tabu search, honey-bee mating optimization, and artificial immune system. Computational simulations show very encouraging results in terms of the quality of solution found, the average number of function evaluations and the processing time required, comparing with mentioned methods.

show abstract

Scheduling flowshops with condition-based maintenance constraint to minimize expected makespan

Cited by 34 publications

References 36 publications

Dynamic Pricing of a Web Service in an Advance Selling Environment

Dynamic Pricing of a Web Service in an Advance Selling Environment

Integrating the sequence dependent setup time open shop problem and preventive maintenance policies

A novel algorithm based on hybridization of artificial immune system and simulated annealing for clustering problem

Contact Info

Product

Resources

About