Scheduling parallel machines by the dynamic newsboy problem
type: Item
instance of: scholarly article
title: Scheduling parallel machines by the dynamic newsboy problem
zbMATH Open document ID: 1057.90016
DOI: 10.1016/S0305-0548(02)00227-7
author: Konstantin Kogan
published in: Computers \& Operations Research
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 2137517
MaRDI profile type: Publication
cites work: Optimal Inventory Policy
cites work: Q5807223
cites work: Q3468851
cites work: The Risk-Averse (and Prudent) Newsboy
cites work: The single-item newsboy problem with dual performance measures and quantity discounts
cites work: The newsboy problem under progressive multiple discounts
cites work: The Structure of Periodic Review Policies in the Presence of Random Yield
cites work: A Periodic Review, Production Planning Model with Uncertain Capacity and Uncertain Demand—Optimality of Extended Myopic Policies
cites work: The newsstand problem: A capacitated multiple-product single-period inventory problem
cites work: On the Effect of Centralization on Expected Costs in a Multi-Location Newsboy Problem
cites work: Multiproduct Production Scheduling for Style Goods with Limited Capacity, Forecast Revisions and Terminal Delivery
cites work: A Stochastic Sequencing Problem for Style Goods with Forecast Revisions and Hierarchical Structure
cites work: Production Planning of Style Goods with High Setup Costs and Forecast Revisions
cites work: Balancing facilities in aggregate production planning: Make-to-order and make-to-stock environments
cites work: A new polynomial-time algorithm for linear programming
full work available at URL: s0305-0548(02)00227-7
OpenAlex ID: W2115401094
description: scientific article; zbMATH DE number 2137517