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
Scheduling unit processing time jobs on an m-machine flow-shop
G. Mosheiov
*
*
Corresponding author for this work
Business Administration
Research output
:
Contribution to journal
›
Article
›
peer-review
7
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Scheduling unit processing time jobs on an m-machine flow-shop'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Flow Shop
100%
Unit Processing Times
100%
Due Date
66%
Scheduling Problem
33%
Polynomial Time Solution
33%
Common Due Date
33%
Processing Time
33%
Maximum Earliness
33%
Real-world Application
33%
Machine Settings
33%
Job-dependent
33%
Earliness-tardiness
33%
Identical Jobs
33%
Sequential Production
33%
Just-in-time
33%
Tardiness Cost
33%
Mathematics
Minimizes
100%
Polynomial Time
100%
Real Life
100%
Computer Science
Processing Time
100%
Polynomial Time
50%
Scheduling Problem
50%
Just-in-Time
50%