× Didn't find what you were looking for? Ask a question
Top Posters
Since Sunday
s
3
v
3
p
3
m
2
s
2
d
2
N
2
d
2
e
2
s
2
s
2
e
2
Home Q & A Board Other Fields Homework Help Business Management
New Topic  
TTImi TTImi
wrote...
Posts: 648
Rep: 0 0
6 years ago
Explain why any sequence chosen in the single-machine scheduling problem will not change makespan time.
Read 66 times
1 Reply

Related Topics

Replies
wrote...
#1
6 years ago
The total processing time for all jobs is constant; no matter which sequence is chosen, the makespan is the same because the time to process all the jobs is the sum of the individual processing times.
M = C - S where,
M = makespan of a group of jobs
C = completion time of last job in the group
S = start time of first job in the group
So, any sequence chosen in the single-machine scheduling problem will not change makespan time.
New Topic      
Quick Reply
Explore
Post your homework questions and get free online help from our incredible volunteers
  1393 People Browsing
Start New Topic Take the Tour CoursesNew Study Tools Topics Trending Browse by Textbook
Live Chat
Related Images
  
 265
  
 157
  
 254