The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem

DOI10.1287/opre.49.2.293.13536zbMath1163.90522OpenAlexW2137955726MaRDI 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

zbMATH Keywords

probabilistic analysisflow shop weighted completion time problemmultiple machine sequencingshortest processing time dispatch rule

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (9)

A joint replenishment policy with individual control and constant size orders ⋮ A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design ⋮ Designing optimal global supply chains at Dow AgroSciences ⋮ A Stochastic Programming Approach to Design Perishable Product Supply Chain Network Under Different Disruptions ⋮ Scheduling a two-stage flowshop under makespan constraint ⋮ A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment ⋮ Asymptotically optimal schedules for single-server flow shop problems with setup costs and times ⋮ Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates ⋮ The relationship between organizational structure, supply chain management, and organizational performance: a study on the semiconductor industry

This page was built for publication: The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem