Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Link opens in a new tab
Search content at The Hebrew University of Jerusalem
Home
Profiles
Research units
Research output
Prizes
Scheduling with two competing agents to minimize total weighted earliness
Enrique Gerstl
*
, Baruch Mor
,
Gur Mosheiov
*
Corresponding author for this work
BA Business Department
Research output
:
Contribution to journal
›
Article
›
peer-review
4
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Scheduling with two competing agents to minimize total weighted earliness'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Dynamic Programming Algorithm
100%
Weighted Earliness
100%
Competitive Agents
100%
NP-hard
66%
Pseudo-polynomial
66%
Polynomial Dynamics
66%
Maximum Earliness
66%
Medium Size
33%
Efficient Heuristics
33%
Dynamic Programming
33%
Single Machine Scheduling Problem
33%
Optimal Schedule
33%
Multi-agent
33%
Numerical Test
33%
Earliness
33%
NP-hardness
33%
Optimality Gap
33%
Complexity Classes
33%
Inverse Problem
33%
Mathematics
Minimizes
100%
Polynomial
100%
Upper Bound
100%
Ordinary Sense
100%
Optimality
50%
Single Machine
50%
Objective Function
50%
Numerical Analysis
50%
Computer Science
Dynamic Programming Algorithm
100%
Dynamic Programming
33%
Objective Function
33%
single machine scheduling problem
33%
Complexity Class
33%
multi agent
33%
Inverse Problem
33%