2 research outputs found

    MULTI-PERIOD SUPPLY CHAIN COORDINATION USING TRADE PROMOTION: COMPLEMENTARY SLACKNESS APPROACH

    No full text
    In this paper, a two-level supply chain network with a single manufacturer supplying a single product to a single retailer is studied. This research uses a trade promotion strategy to coordinate the supply chain by finding the optimal pre-announced multi-period wholesale prices that can induce the retailer’s decentralized decisions to be the same as the retailer’s centralized decisions with the minimum total cost for the supply chain. The manufacturer makes production, inventory, and wholesale price decisions. The retailer makes ordering and inventory decisions. A procedure is proposed to determine optimal wholesale prices to pre-announce in each period to the retailer, coordinating the supply chain using complementary slackness conditions. The results show the coordination benefits for a supply chain when the setup or reorder cost is high but the average demand is low. Finally, the performance of the proposed method is compared with the performance of the “Every Day Low Price” wholesale price policy

    A Genetic Algorithm Approach for Production Capacity Planning Depends on Workers’ Expertise with Consideration of Learning and Forgetting

    Get PDF
    āđāļĢāļ‡āļ‡āļēāļ™āļ–āļ·āļ­āđ€āļ›āđ‡āļ™āļ›āļąāļˆāļˆāļąāļĒāļŦāļ™āļķāđˆāļ‡āļ—āļĩāđˆāļ„āļ§āļĢāļ„āļģāļ™āļķāļ‡āļ–āļķāļ‡āđƒāļ™āļāļēāļĢāļ§āļēāļ‡āđāļœāļ™āļāļēāļĢāļœāļĨāļīāļ• āļ„āļļāļ“āļĨāļąāļāļĐāļ“āļ°āļžāļīāđ€āļĻāļĐāļ‚āļ­āļ‡āđāļĢāļ‡āļ‡āļēāļ™āļ„āļ·āļ­āļĄāļĩāļāļēāļĢāđ€āļĢāļĩāļĒāļ™āļĢāļđāđ‰āđāļĨāļ°āļāļēāļĢāļŦāļĨāļ‡āļĨāļ·āļĄāļ•āļēāļĄāļ›āļĢāļ°āļŠāļšāļāļēāļĢāļ“āđŒāđāļĨāļ°āļ„āļ§āļēāļĄāļ–āļĩāđˆāđƒāļ™āļāļēāļĢāļ—āļģāļāļīāļˆāļāļĢāļĢāļĄāļāļēāļĢāļœāļĨāļīāļ•āđāļšāļšāđƒāļ”āđāļšāļšāļŦāļ™āļķāđˆāļ‡ āļ‹āļķāđˆāļ‡āļŠāđˆāļ‡āļœāļĨāļ•āđˆāļ­āļāļģāļĨāļąāļ‡āļāļēāļĢāļœāļĨāļīāļ•āļ‚āļ­āļ‡āļžāļ™āļąāļāļ‡āļēāļ™āđāļ•āđˆāļĨāļ°āļ„āļ™āđāļĨāļ°āļŠāđˆāļ‡āļœāļĨāļ•āđˆāļ­āļāļģāļĨāļąāļ‡āļāļēāļĢāļœāļĨāļīāļ•āļĢāļ§āļĄ āļāļēāļĢāļ§āļēāļ‡āđāļœāļ™āļāļēāļĢāļœāļĨāļīāļ•āđāļĨāļ°āļĄāļ­āļšāļŦāļĄāļēāļĒāļ‡āļēāļ™āļŠāļģāļŦāļĢāļąāļšāļ­āļ‡āļ„āđŒāļāļĢāļ—āļĩāđˆāļĄāļĩāļŠāļīāļ™āļ„āđ‰āļēāļŦāļĨāļēāļāļŦāļĨāļēāļĒāđāļĨāļ°āļ„āļ§āļēāļĄāļ•āđ‰āļ­āļ‡āļāļēāļĢāļŠāļīāļ™āļ„āđ‰āļēāđ„āļĄāđˆāļ„āļ‡āļ—āļĩāđˆ āļĄāļĩāļ„āļ§āļēāļĄāļĒāļļāđˆāļ‡āļĒāļēāļāđƒāļ™āļāļēāļĢāļ•āļąāļ”āļŠāļīāļ™āđƒāļˆāđ‚āļ”āļĒāđ€āļ‰āļžāļēāļ°āļāļąāļšāļœāļđāđ‰āļ§āļēāļ‡āđāļœāļ™āļ—āļĩāđˆāđ€āļ›āđ‡āļ™āļĄāļ™āļļāļĐāļĒāđŒ āļ‡āļēāļ™āļ§āļīāļˆāļąāļĒāļ™āļĩāđ‰āļ™āļģāđ€āļŠāļ™āļ­āļāļēāļĢāļ™āļģāļ­āļąāļ•āļĢāļēāļāļēāļĢāđ€āļĢāļĩāļĒāļ™āļĢāļđāđ‰āđāļĨāļ°āļāļēāļĢāļŦāļĨāļ‡āļĨāļ·āļĄāļĄāļēāļžāļīāļˆāļēāļĢāļ“āļēāļāļģāļŦāļ™āļ”āļāļģāļĨāļąāļ‡āļāļēāļĢāļœāļĨāļīāļ•āļ‚āļ­āļ‡āļžāļ™āļąāļāļ‡āļēāļ™āđƒāļ™āļāļēāļĢāļ§āļēāļ‡āđāļœāļ™āļāļēāļĢāļœāļĨāļīāļ•āđāļĨāļ°āļĄāļ­āļšāļŦāļĄāļēāļĒāļ‡āļēāļ™āđƒāļŦāđ‰āļžāļ™āļąāļāļ‡āļēāļ™āđāļ•āđˆāļĨāļ°āļ„āļ™ āļāļēāļĢāļĄāļ­āļšāļŦāļĄāļēāļĒāļ‡āļēāļ™āļ—āļĩāđˆāđ€āļŦāļĄāļēāļ°āļŠāļĄāļāļąāļšāļ„āļ§āļēāļĄāđ€āļŠāļĩāđˆāļĒāļ§āļŠāļēāļāļ‚āļ­āļ‡āļžāļ™āļąāļāļ‡āļēāļ™āļˆāļ°āļŠāđˆāļ§āļĒāļĨāļ”āđ€āļ§āļĨāļēāļ—āļĩāđˆāđƒāļŠāđ‰āđƒāļ™āļāļēāļĢāļœāļĨāļīāļ•āļĨāļ‡āļŦāļĢāļ·āļ­āļ—āļģāđƒāļŦāđ‰āļĄāļĩāļāļģāļĨāļąāļ‡āļāļēāļĢāļœāļĨāļīāļ•āđ€āļžāļīāđˆāļĄāļ‚āļķāđ‰āļ™āđ„āļ”āđ‰āđ€āļĄāļ·āđˆāļ­āđ€āļ—āļĩāļĒāļšāļāļąāļšāļāļēāļĢāļ§āļēāļ‡āđāļœāļ™āļāļēāļĢāļœāļĨāļīāļ•āļ”āđ‰āļ§āļĒāļ™āđ‚āļĒāļšāļēāļĒāļĄāļ­āļšāļŦāļĄāļēāļĒāļ‡āļēāļ™āđāļšāļšāļ•āļēāļĒāļ•āļąāļ§ āđ‚āļ”āļĒāļ‡āļēāļ™āļ§āļīāļˆāļąāļĒāļ™āļĩāđ‰āđƒāļŠāđ‰āļ§āļīāļ˜āļĩāļāļēāļĢāđ€āļŠāļīāļ‡āļžāļąāļ™āļ˜āļļāļāļĢāļĢāļĄāđƒāļ™āļāļēāļĢāļŦāļēāļ„āļģāļ•āļ­āļšāļŦāļĢāļ·āļ­āđāļœāļ™āļāļēāļĢāļœāļĨāļīāļ•āđ‚āļ”āļĒāļĄāļĩāđ€āļ›āđ‰āļēāļŦāļĄāļēāļĒāđ€āļžāļ·āđˆāļ­āļāļģāđ„āļĢāļŠāļđāļ‡āļŠāļļāļ” āļĄāļĩāļāļēāļĢāļ—āļ”āļŠāļ­āļšāļžāļēāļĢāļēāļĄāļīāđ€āļ•āļ­āļĢāđŒāļ‚āļ­āļ‡āļ§āļīāļ˜āļĩāļāļēāļĢāđ€āļŠāļīāļ‡āļžāļąāļ™āļ˜āļļāļāļĢāļĢāļĄ 4 āļĢāļđāļ›āđāļšāļš āđ„āļ”āđ‰āđāļāđˆ C4M3 C4M7 C8M3 āđāļĨāļ° C8M7 āļœāļĨāļāļēāļĢāļ—āļ”āļĨāļ­āļ‡āļžāļšāļ§āđˆāļēāļ§āļīāļ˜āļĩāļāļēāļĢāđ€āļŠāļīāļ‡āļžāļąāļ™āļ˜āļļāļāļĢāļĢāļĄāļĄāļĩāļ›āļĢāļ°āļŠāļīāļ—āļ˜āļīāļ āļēāļžāļ—āļĩāđˆāļ”āļĩāļāļ§āđˆāļēāļ„āļ·āļ­āđƒāļŦāđ‰āļœāļĨāļāļģāđ„āļĢāļ—āļĩāđˆāļŠāļđāļ‡āļāļ§āđˆāļēāđ€āļĄāļ·āđˆāļ­āđ€āļ›āļĢāļĩāļĒāļšāđ€āļ—āļĩāļĒāļšāļāļąāļšāļ™āđ‚āļĒāļšāļēāļĒāļāļēāļĢāļĄāļ­āļšāļŦāļĄāļēāļĒāļ‡āļēāļ™āđāļšāļšāļ•āļēāļĒāļ•āļąāļ§ āđ‚āļ”āļĒāļĢāļđāļ›āđāļšāļšāļžāļēāļĢāļēāļĄāļīāđ€āļ•āļ­āļĢāđŒāļ—āļĩāđˆāđ€āļŦāļĄāļēāļ°āļŠāļĄāļ„āļ·āļ­ C8M3 āđ€āļ™āļ·āđˆāļ­āļ‡āļˆāļēāļāļĄāļĩāļ›āļĢāļ°āļŠāļīāļ—āļ˜āļīāļ āļēāļžāđƒāļ™āļāļēāļĢāļŦāļēāļ„āļģāļ•āļ­āļšāļ—āļĩāđˆāđƒāļŦāđ‰āļāļģāđ„āļĢāļŠāļđāļ‡āļŠāļļāļ”āđāļĨāļ°āđƒāļŠāđ‰āđ€āļ§āļĨāļēāđƒāļ™āļāļēāļĢāļŦāļēāļ„āļģāļ•āļ­āļšāļ™āđ‰āļ­āļĒWorkforce is one of the factors that should be considered in production planning. The special characteristics of workforce include learning and forgetting corresponding to experience and frequency of performing the production activity affecting capability of workers and total production capacity. The production planning and worker assignment of multiple products with time-varying demand are complicated for decision-making, especially for human planners. This research proposed the use of learning and forgetting rates to determine workforce capacity for production planning and work assignment. A suitable assignment by considering the worker’s expertise can reduce production time or increase production capacity when compared with the fixed assignment policy. A genetic algorithm was used to find the production plan with maximum profit. The parameters of genetic algorithm were tested in 4 models, i.e. C4M3, C4M7, C8M3, and C8M7. From the results showed that the proposed genetic algorithm approach had better performance than the fixed assignment policy. The suitable parameter of the genetic algorithm is C8M3 providing high performance in finding the best solution with less calculating time
    corecore