An improved precedence rule for single machine sequencing problems with quadratic penalty

2000 ◽  
Vol 125 (2) ◽  
pp. 425-428 ◽  
Author(s):  
Sakib A Mondal ◽  
Anup K Sen
1996 ◽  
Vol 88 (2) ◽  
pp. 345-347 ◽  
Author(s):  
Umar M. Al-Turki ◽  
John Mittenthal ◽  
M. Raghavachari

1972 ◽  
Vol 18 (9) ◽  
pp. 518-528 ◽  
Author(s):  
Alan G. Merten ◽  
Mervin E. Muller

2021 ◽  
Vol 8 (1) ◽  
pp. 8-21
Author(s):  
Radhakrishnan S ◽  
Saikeerthana D

This paper deals with sequencing problems for ‘n’ jobs on single machine, ‘n’ jobs on two machines, ‘n’ jobs on three machines and ‘n’ jobs on ‘m’ machines. Here, we consider the sequencing problem where the processing time, due dates, weights are taken as intervals. An algorithm is provided for obtaining an optimal sequence and also for determining the minimum duration taken to complete all the jobs. To illustrate this, numerical examples are provided.


1989 ◽  
Vol 40 (3) ◽  
pp. 293-297 ◽  
Author(s):  
T D Fry ◽  
L Vicens ◽  
K Macleod ◽  
S Fernandez

Sign in / Sign up

Export Citation Format

Share Document