Open Access. Powered by Scholars. Published by Universities.®

Business Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Business

Pivot Or Perish: The Retail Reality, Anne Lepissier, Ryan Vaughan, Shantanu Bhattacharya Nov 2021

Pivot Or Perish: The Retail Reality, Anne Lepissier, Ryan Vaughan, Shantanu Bhattacharya

Perspectives@SMU

Brick-and-mortar retailers are adapting to meet the challenges posed by accelerating e-commerce adoption. Some are doing better than others, but supply chain obstacles could prove decisive


Sustainably Feeding The World In The 21st Century, Ren Hua Ho, Husodo Angkosubroto, Oi Hian Lee Nov 2021

Sustainably Feeding The World In The 21st Century, Ren Hua Ho, Husodo Angkosubroto, Oi Hian Lee

Perspectives@SMU

Managing investor expectation, exploiting low-hanging fruit, and farmer education will be key


How To Spot And Avoid Greenwashing In Supply Chains, Singapore Management University Jun 2021

How To Spot And Avoid Greenwashing In Supply Chains, Singapore Management University

Perspectives@SMU

Research draws attention to practice of firms greenwashing their CSR by disclosing supply chain relationships with “green” but concealing “brown” suppliers


Multi-Period Lot-Sizing With Supplier Selection: Structural Results, Complexity And Algorithms, Meichun Lin, Woonghee Tim Huh, Guohua Wan Jun 2021

Multi-Period Lot-Sizing With Supplier Selection: Structural Results, Complexity And Algorithms, Meichun Lin, Woonghee Tim Huh, Guohua Wan

Research Collection Lee Kong Chian School Of Business

We consider a multi-period lot-sizing problem with multiple products and multiple suppliers. Demand is deterministic and time-varying. The objective is to determine order quantities to minimize the total cost over a finite planning horizon. This problem is strongly NP-hard. For a special case, we extend the classical zero-inventory-ordering principle and solve it by dynamic programming. Based on this new extension, we also develop a heuristic algorithm for the general problem and computationally show that it works well.