1987
DOI: 10.1080/00207548708919930
|View full text |Cite
|
Sign up to set email alerts
|

A comparative analysis of the COVERT job sequencing rule using various shop performance measures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0

Year Published

1992
1992
2012
2012

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 92 publications
(28 citation statements)
references
References 12 publications
0
27
0
Order By: Relevance
“…This can be easily done by summing the processing times of all operations for each job, and multiplying this summation with a certain allowance factor value (c) that represents the due date tightness. The values for the allowance factor have been experimentally set such that approximately x% of the jobs will finish later than their due date (Jensen et al, 1995;Russell et al, 1987). To that purpose, the job shop instances have been scheduled with the quick and easy SPT rule applicable to various objective functions for different values of the allowance factor.…”
Section: Approachmentioning
confidence: 99%
See 1 more Smart Citation
“…This can be easily done by summing the processing times of all operations for each job, and multiplying this summation with a certain allowance factor value (c) that represents the due date tightness. The values for the allowance factor have been experimentally set such that approximately x% of the jobs will finish later than their due date (Jensen et al, 1995;Russell et al, 1987). To that purpose, the job shop instances have been scheduled with the quick and easy SPT rule applicable to various objective functions for different values of the allowance factor.…”
Section: Approachmentioning
confidence: 99%
“…Section A.2 list the single priority rules together with their mathematical formulation. For this overview, we based ourselves on the papers of, among others, Panwalkar and Iskander (1977), Blackstone et al (1982), Baker (1984), Russell et al (1987), Vepsalainen and Morton (1987), Anderson and Nyirenda (1990), Waikar et al (1995), Holthaus and Rajendran (1997), Rajendran and Holthaus (1999), Jayamohan and Rajendran (2000), Holthaus and Rajendran (2000), Dominic et al (2004), Mizrak and Bayhan (2006) and Chiang and Fu (2007). Finally, in Section A.3, more information is given on the combination of the single rules.…”
Section: Appendix Amentioning
confidence: 99%
“…The parameter is called the lead-time estimation parameter that takes account of waiting time, while is called the adjustment multiplier that adjusts the expected waiting time to the worst case. See Russell et al [18] and Vepsalainen and Morton [22] for more details. In this study, we test combinations of several values for these two parameters, and select the best values considering the solution quality and the CPU time.…”
Section: Part Scheduling Algorithmsmentioning
confidence: 99%
“…While is called the lead-time estimation parameter that considers waiting time between operations of a lot, is called the adjustment multiplier that adjusts expected waiting time to the worst case. See Russell et al [14] and Vepsalainen and Morton [15] for more details.…”
Section: A Lot Release Controlmentioning
confidence: 99%