Scheduling parallel machines by the dynamic newsboy problem

DOI10.1016/S0305-0548(02)00227-7zbMath1057.90016OpenAlexW2115401094MaRDI QIDQ1765550

Konstantin Kogan

Publication date: 23 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00227-7

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Stochastic Stackelberg equilibria with applications to time-dependent newsvendor models

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• The newsboy problem under progressive multiple discounts
• The single-item newsboy problem with dual performance measures and quantity discounts
• The newsstand problem: A capacitated multiple-product single-period inventory problem
• A Stochastic Sequencing Problem for Style Goods with Forecast Revisions and Hierarchical Structure
• Production Planning of Style Goods with High Setup Costs and Forecast Revisions
• On the Effect of Centralization on Expected Costs in a Multi-Location Newsboy Problem
• Balancing facilities in aggregate production planning: Make-to-order and make-to-stock environments
• A Periodic Review, Production Planning Model with Uncertain Capacity and Uncertain Demand—Optimality of Extended Myopic Policies
• The Risk-Averse (and Prudent) Newsboy
• Multiproduct Production Scheduling for Style Goods with Limited Capacity, Forecast Revisions and Terminal Delivery
• The Structure of Periodic Review Policies in the Presence of Random Yield
• Optimal Inventory Policy

This page was built for publication: Scheduling parallel machines by the dynamic newsboy problem