The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem
From MaRDI portal
Publication:3635001
DOI10.1287/opre.49.2.293.13536zbMath1163.90522MaRDI QIDQ3635001
David Simchi-Levi, Philip M. Kaminsky
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.49.2.293.13536
probabilistic analysis; flow shop weighted completion time problem; multiple machine sequencing; shortest processing time dispatch rule
90B36: Stochastic scheduling theory in operations research
Related Items
Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates, A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment, A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design, Designing optimal global supply chains at Dow AgroSciences, Scheduling a two-stage flowshop under makespan constraint, Asymptotically optimal schedules for single-server flow shop problems with setup costs and times, A joint replenishment policy with individual control and constant size orders, A Stochastic Programming Approach to Design Perishable Product Supply Chain Network Under Different Disruptions, The relationship between organizational structure, supply chain management, and organizational performance: a study on the semiconductor industry
