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
Minmax scheduling problems with common flow-allowance
B. Mor,
G. Mosheiov
*
*
Corresponding author for this work
Business Administration
Research output
:
Contribution to journal
›
Article
›
peer-review
15
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Minmax scheduling problems with common flow-allowance'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Scheduling Problem
100%
Min-max
100%
Common Flow Allowance
100%
Flow Allowance
100%
Due Date
66%
Polynomial Time Solution
33%
Optimal Schedule
33%
Processing Time
33%
Position-dependent Processing Times
33%
Single Machine
33%
Earliness-tardiness
33%
Due Window
33%
Assignment Problem
33%
General Position
33%
Due Date Assignment
33%
Job Schedule
33%
Cost Components
33%
Job Flows
33%
Explicit Costs
33%
Mathematics
Minimizes
100%
Polynomial Time
100%
Single Machine
100%
Objective Function
100%
Total Cost
100%
Independent Constant
100%