Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
Minimizing the number of tardy jobs with controllable processing times
Liron Yedidsion,
Moshe Kaspi
Department of Industrial Engineering and Management
Research output
:
Contribution to conference
›
Paper
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Minimizing the number of tardy jobs with controllable processing times'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Controllable Processing Times
100%
Number of Tardy Jobs
100%
Resource-dependent Processing Times
66%
Consumption Function
66%
Controllable Resources
66%
Job Problems
66%
NP-hard
33%
Polynomial-time Algorithm
33%
Realistic Scenario
33%
Processing Time
33%
Computational Complexity
33%
Heuristic Algorithms
33%
Common Resources
33%
Continuous Resource
33%
Law of Diminishing Returns
33%
Robust Solution
33%
Non-renewable Resources
33%
Resource Consumption Function
33%
Mathematics
Consumption Function
100%
Polynomial
33%
Wide Range
33%
Real Life
33%
Heuristic Algorithm
33%
Diminishing Return
33%
Computer Science
Processing Time
100%
Computational Complexity
25%
Heuristic Algorithm
25%
Resource Consumption
25%
Life Situation
25%
Polynomial Algorithm
25%
Robust Solution
25%
Engineering
Processing Time
100%
Limited Number
25%
Resource Consumption
25%
Real Life
25%
Computational Complexity
25%
Robust Solution
25%
Psychology
Processing Time
100%