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
Two-machine flow-shop scheduling with rejection
Dvir Shabtay
, Nufar Gasper
Department of Industrial Engineering and Management
Research output
:
Contribution to journal
›
Article
›
peer-review
32
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Two-machine flow-shop scheduling with rejection'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Flow Shop Scheduling
100%
Machine Scheduling
97%
Rejection
81%
Fully Polynomial Time Approximation Scheme
48%
Costs
34%
NP-complete problem
18%
Single Machine
14%
NP-hardness
14%
Optimization Algorithm
12%
Schedule
12%
Scheduling Problem
12%
Polynomial-time Algorithm
10%
Approximation Algorithms
10%
Entire
10%
Evaluate
9%
Polynomial time
9%
Business & Economics
Flow Shop Scheduling
92%
Polynomials
69%
Makespan
63%
Approximation
35%
NP-hard
29%
Costs
21%
NP-hardness
20%
Approximation Algorithms
17%
Single Machine
16%
Scheduling Problem
12%
Schedule
11%
Engineering & Materials Science
Polynomials
54%
Scheduling
48%
NP-hard
41%
Approximation algorithms
30%
Costs
21%
Set theory
9%