Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Link opens in a new tab
Search content at Tel Aviv University
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
A combinatorial approach to a class of parallel-machine, continuous-time scheduling problems
Konstantin Kogan
,
Eugene Khmelnitsky
, Eugene Levner
Engineering General
Holon Institute of Technology
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A combinatorial approach to a class of parallel-machine, continuous-time scheduling problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Scheduling Problem
100%
Production Cost
100%
Backlog
100%
Combinatorial Approach
100%
Parallel Machines
100%
Continuous-time Scheduling
100%
Exact Optimal Solution
100%
Maximum Principle
50%
Manufacturing Systems
50%
Approximation Methods
50%
Single Product
50%
Production Rate
50%
Product Type
50%
Numerical Methods
50%
Constant Demand
50%
Inventory Cost
50%
Exponential Time
50%
Piecewise Constant
50%
Arbitrary Functions
50%
K Levels
50%
Machine Manufacturing
50%
Unrelated Parallel Machine Scheduling Problem (UPMSP)
50%
Mathematics
Polynomial
100%
Continuous Time
100%
Approximates
100%
Exponential Time
100%
Single Mode
100%
Arbitrary Function
100%
Product Type
100%
Mathematical Method
100%
Maximum Principle
100%
Manufacturing System
100%
Social Sciences
Production Cost
100%
Mathematical Method
50%
Maximum Principle
50%