Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
Scheduling parallel machines by the dynamic newsboy problem
Konstantin Kogan
Department of Mathematics
Department of Social & Health Sciences
Research output
:
Contribution to journal
›
Article
›
peer-review
5
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Scheduling parallel machines by the dynamic newsboy problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Parallel Machines
100%
Newsboy Problem
100%
Single-period
50%
Continuous-time
37%
Surplus Cost
25%
Dynamic Continous
25%
Polynomial Time
12%
Production Cost
12%
Planning Horizon
12%
Expected Profit
12%
Combinatorial Algorithms
12%
Expected Cost
12%
Associated Costs
12%
Extension of Time
12%
Discrete-time
12%
Time Problem
12%
Shortage Cost
12%
Order Quantity
12%
Planning Period
12%
Production Conditions
12%
Product Order
12%
Newsboy
12%
Retail Industry
12%
Operation Research Model
12%
Globally Optimal Solution
12%
Service Industry
12%
Manufacturing Industry
12%
Probabilistic Demand
12%
Intermediate Production
12%
Mathematics
Single Period
100%
Continuous Time
75%
Minimizes
50%
Periodic Time
25%
Combinatorial Algorithm
25%
Total Amount
25%
time point η
25%
Operations Research
25%
Polynomial Time
25%
Discrete Time
25%
Planning Horizon
25%
Computer Science
Parallel Machine Scheduling
100%
Continuous Time
100%
discrete-time
33%
Globally Optimal Solution
33%
System Analysis
33%
Polynomial Time
33%
Planning Horizon
33%