During the past two decades, there have been increasing interests on permutation flow shop with different types of objective functions such as minimizing the makespan, the weighted mean flow-time etc. The permutation flow shop is formulated as a mixed integer programming and it is classified as NP-Hard problem. Therefore, a direct solution is not available and metaheuristic approaches need to be used to find the near-optimal solutions. In this paper, we present a new discrete firefly meta-heuristic to minimize the makespan for the permutation flow shop scheduling problem. The results of implementation of the proposed method are compared with other existing ant colony optimization technique. The preliminary results indicate that the new proposed method performs better than the ant colony for some well known benchmark problems.
Advertising plays an important role in sales promotion in supply chains. In this paper, advertising decisions for retail and online channels respectively, by retailer and manufacturer will be analyzed. The competition between retailer and manufacturer will be modeled by differential game theory, and feedback Nash equilibrium of the game will be obtained. Some insights are provided by using comparative statics. The obtained results show that compatibility factor of a product with online marketing, difference between manufacturer's online price and wholesale price, effectiveness of advertising, marginal profits, and cost of advertising all have significant effects on the advertising decisions in the equilibrium.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.