Operations Research · 2009 · 537 citations · 70 references
ManagementIndustrial EngineeringOperations ManagementInventory ControlInventory ManagementSchedulingPerishable Inventory ManagementProduction SchedulingScheduling TheoryExact AlgorithmsModel-based RepresentationOn-time DeliveryOptimality ConditionsOutbound LogisticsPolynomial-time AlgorithmsTotal Cost Minimization
In make‑to‑order and time‑sensitive settings, finished products are rarely stored, so production and outbound distribution must be jointly scheduled to meet on‑time delivery targets at minimal cost, a problem that has recently attracted growing research attention. This paper surveys integrated production and outbound distribution scheduling models, offering a unified representation scheme and classifying them into several distinct categories. For each category, the authors summarize optimality properties, computational tractability, and solution algorithms, and provide proofs of tractability or intractability for open problems. The study clarifies the tractability of several open and new problems, presents polynomial‑time exact algorithms, and identifies future research directions.
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after the production. Consequently, there is little or no finished product inventory in the supply chain such that production and outbound distribution are very intimately linked and must be scheduled jointly to achieve a desired on-time delivery performance at minimum total cost. Research on integrated scheduling models of production and outbound distribution is relatively recent but is growing very rapidly. In this paper, we provide a survey of such existing models. We present a unified model representation scheme, classify existing models into several different classes, and for each class of the models give an overview of the optimality properties, computational tractability, and solution algorithms for the various problems studied in the literature. We clarify the tractability of some open problems left in the literature and some new problems by providing intractability proofs or polynomial-time exact algorithms. We also identify several problem areas and issues for future research.
70
Scheduling: Theory, Algorithms, and Systems
Michael Pinedo · IIE Transactions · 1996 · 6.3K citations
The Complexity of Flowshop and Jobshop Scheduling
M. R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research · 1976 · 2.6K citations