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
Parallel machine scheduling problems with common flow-allowance
Baruch Mor,
Gur Mosheiov
*
*
Corresponding author for this work
BA Business Department
Research output
:
Contribution to journal
›
Article
›
peer-review
12
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Parallel machine scheduling problems with common flow-allowance'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Numerical Test
100%
Assignment Problem
100%
Common Flow Allowance
100%
Parallel Machine Scheduling Problem
100%
NP-hard
50%
Efficient Heuristics
50%
Due Date
50%
Optimal Schedule
50%
Processing Time
50%
Job Processing
50%
Optimality Gap
50%
Parallel Identical Machines
50%
Job-dependent
50%
Uniform Machines
50%
Due-window Assignment
50%
Due Window
50%
Linear Function
50%
Worst-case Analysis
50%
Min-max
50%
Problem-based
50%
Due Date Assignment
50%
Heuristic Procedure
50%
Flow Allowance
50%
Average Optimality
50%
Mathematics
Optimality
100%
Objective Function
100%
Worst Case
100%
Linear Function
100%
Case Analysis
100%
Computer Science
Machine Scheduling Problem
100%
Assignment Problem
100%
Parallel Machine Scheduling
100%
Processing Time
50%
Objective Function
50%
Linear Function
50%