Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Home
Profiles
Research units
Research output
Prizes
Search by expertise, name or affiliation
Minimizing maximum earliness on parallel identical machines
Micha Mandel
,
Gur Mosheiov
*
*
Corresponding author for this work
Department of Statistics
BA Business Department
Research output
:
Contribution to journal
›
Article
›
peer-review
3
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Minimizing maximum earliness on parallel identical machines'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Maximum Earliness
100%
Earliness
100%
Parallel Identical Machines
100%
Lateness
75%
Scheduling Problem
50%
Efficient Heuristics
50%
Cost Components
50%
Two-machine
25%
NP-hard
25%
Pseudo-polynomial
25%
Polynomial Dynamics
25%
Dynamic Programming Algorithm
25%
Machine Settings
25%
Optimal Cost
25%
NP-hard in the Strong Sense
25%
Min-max
25%
Tardiness Cost
25%
Total Earliness
25%
Performance Measures
25%
Real-life Setting
25%
Tardiness
25%
Inventory Cost
25%
Simple Bounds
25%
Mathematics
Polynomial
100%
Upper Bound
100%
Ordinary Sense
100%
Numerical Analysis
100%
Real Life
100%
Performance Measure
100%
Considered Problem
100%
Computer Science
Scheduling Problem
100%
Dynamic Programming Algorithm
50%
Considered Problem
50%
Performance Measure
50%
inventory cost
50%