Articles
Journal of Modelling in Management (17465672)20(3)pp. 974-1002
Purpose: This study aims to investigate the pricing dynamics within a triple-channel supply chain. The publisher can sell printed books (p-books) through bookstores or online direct sales, and electronic books (e-books) are sold directly through the internet. The primary objectives include determining optimal wholesale and final prices for p-books, assessing the profitability of introducing e-books, comparing profits across channels and supply chain modes and identifying optimal demand volumes. Design/methodology/approach: The research uses first-order derivatives and the Stackelberg game to analyze the pricing strategies. Two supply chain modes, centralized and decentralized, are considered, and various parameters are examined to understand their impact on prices, demand volumes and final sales profit. Findings: The results indicate that the e-book is either not published or is introduced simultaneously with the printed version in both modes. In the decentralized mode, the wholesale price of a p-book is equivalent to the final price in the bookstore channel in the centralized mode. One channel among the three selling channels is used to maximize the total profit in the centralized supply chain, whereas all demand should be fulfilled through either online direct sales or e-book channels in the decentralized mode. Originality/value: This paper introduces a comprehensive triple-channel book supply chain model, considering cross-price sensitivities and lag times for e-books. The study provides insights into the dynamics of the book industry and compares them with existing literature, contributing to a broader understanding of the pricing strategies in a triple-channel context. © 2024, Emerald Publishing Limited.
Scientia Iranica (23453605)31(6)pp. 500-517
In this paper, we address the weighted multi-objective re-entrant flowshop scheduling problem considering release dates in order to minimize makespan, total completion time, total tardiness, maximum idle time, and number of tardy jobs. Each job is taken into account with deterministic processing times, and release dates. The flow-shop comprised of two workshops in whose jobs are entered to the main workshop and after the firrst part of the processing, they are transferred to the second workshop and after this stage, the jobs are returned to the main workshop for the last part of the processing. We model the problem by a new mixed integer programming based on formulating sum of idle time as a new concept. Moreover, a hybrid evolutionary algorithm is proposed based on some dispatching rules, ant colony optimization, and genetic algorithm. The performance of the proposed algorithm on some test instances is compared to the mixed integer linear programming model as well as the state-of-the-art algorithms called genetic algorithm, tabu search, bio-geography based optimization, and artificial bee colony. The computational experiments show that our proposed approach outperforms other algorithms and the results indicate efficiency and capability of the proposed algorithm in comparison with the traditional algorithms. © 2024 Sharif University of Technology. All rights reserved.
