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 with a common due-window: Polynomially solvable cases
Gur Mosheiov
, Assaf Sarig
*
*
Corresponding author for this work
BA Business Department
Research output
:
Contribution to journal
›
Article
›
peer-review
15
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Scheduling with a common due-window: Polynomially solvable cases'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Common Due Window
100%
Job Sequencing
100%
Polynomially Solvable Cases
100%
Flow Shop
50%
Polynomial Time Solution
50%
NP-hard
50%
Single Machine Scheduling Problem
50%
Common Due Date
50%
Single Machine
50%
Parallel Identical Machines
50%
Due-window Assignment
50%
Due Window
50%
Unit Processing Times
50%
Due Date Assignment
50%
Job Completion Time
50%
Scheduling Window
50%
Absolute Deviation
50%
Job Problems
50%
Structured Linear Programs
50%
Computer Science
Polynomial Time
100%
Processing Time
100%
single machine scheduling problem
100%
Single Machine
100%
Completion Time
100%
Linear Program
100%
Engineering
Processing Time
100%
Polynomial Time
100%
Linear Program
100%
Absolute Deviation
100%