Constraint isomorphism and the generation of stochastic data

References

• Abdul-Razaq , T. S. , Potts , C. N. and Van Wassenhove , L. N. 1990 . A survey of algorithms for the single machine total weighted tardiness scheduling problem . Discrete Applied Mathematics , 26 : 235 – 253 . [CSA]
   Web of Science ®Google Scholar
• Akturk , S. and Yildirim , M. B. 1999 . A new dominance rule for the total weighted tardiness problem . Production Planning & Control , 10 ( 2 ) : 138 – 149 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Baker , K. R. 1995 . Elements of Sequencing & Scheduling , Hanover , NH : Kenneth R. Baker .
   Google Scholar
• Chambers , R. , Carraway , R. , Lowe , T. and Morin , T. 1991 . Dominance and decomposition heuristics for single machine scheduling . Operations Research , 39 ( 4 ) : 639 – 647 . [CSA]
   Web of Science ®Google Scholar
• Fadlalla , A. and Evans , J. 1995 . Improving the performance of enumerative search methods—part I: exploiting structure and intelligence . Journal of Computers and Operations Research , 22 ( 6 ) : 605 – 613 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Fadlalla , A. , Evans , J. and Levy , M. 1994 . A new heuristic for solving the total tardiness problem . Journal of Computers and Operations Research , 21 ( 3 ) : 329 – 336 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Fadlalla , A. , Evans , J. and Levy , M. 1995 . Improving the performance of enumerative search methods part II: computational experiments . Journal of Computers and Operations Research , 22 ( 10 ) : 987 – 994 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Fisher , M. 1976 . A dual algorithm for the one machine scheduling problem . Mathematical Programming , 11 : 229 – 251 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• French , S. 1983 . Sequencing and Scheduling: The Mathematics of the Job Shop , Chichester , UK : Wiley .
   Google Scholar
• Hall , N. and Posner , M. 2001 . Generating experimental data for computational testing with machine scheduling applications . Operations Research , 49 ( 7 ) : 854 – 865 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Hillier , F. S. and Lieberman , G. J. 2002 . Introduction to Operations Research, , 7th edn. , New York , NY : McGraw-Hill .
   Google Scholar
• Holsenback , J. and Russell , R. 1992 . A heuristic algorithm for sequencing on one machine to minimize total tardiness . Journal of the Operational Research Society , 43 ( 1 ) : 53 – 62 . [CSA]
   Web of Science ®Google Scholar
• Koulamas , C. 1994 . The total tardiness problem: review and extensions . Operations Research , 42 ( 6 ) : 1025 – 1041 . [CSA]
   Web of Science ®Google Scholar
• Panwalker , S. , Smith , M. and Koulamas , C. 1993 . A heuristic for the single-machine tardiness problem . European Journal of Operational Research , 70 : 304 – 310 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Potts , C. N. and Van Wassenhove , L. 1982 . A decomposition algorithm for the single-machine total tardiness problem . Operations Research Letters , 1 ( 5 ) : 177 – 181 . [CROSSREF] [CSA]
   Google Scholar
• Potts , C. N. and Van Wassenhove , L. 1985 . A branch and bound algorithm for the total weighted tardiness problem . Operations Research , 33 ( 2 ) : 363 – 377 . [CSA]
   Web of Science ®Google Scholar
• Potts , C. N. and Van Wassenhove , L. 1987 . Dynamic programming and decomposition approaches for the single-machine total tardiness problem . European Journal of Operational Research , 32 : 405 – 414 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Potts , C. N. and Van Wassenhove , L. 1991 . Single machine sequencing heuristics . IIE Transactions , 23 ( 4 ) : 346 – 354 . [CSA]
   Web of Science ®Google Scholar
• Rinnooy , Kan A. , Lageweg , B. and Lenstra , J. 1975 . Minimizing total costs in one machine scheduling . Operations Research , 23 ( 5 ) : 908 – 927 . [CSA]
   Web of Science ®Google Scholar
• Srinivisan , V. 1971 . A hybrid algorithm for the one machine sequencing problem to minimize total tardiness . Naval Research Logistics Quarterly , 18 ( 3 ) : 317 – 327 . [CSA]
   Google Scholar
• Szwarc , W. and Mukhopadhyay , S. 1996 . Decomposition of the single machine total tardiness problem . Operations Research Letters , 19 : 243 – 250 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Wilkerson , L. and Irwin , J. 1971 . An improved algorithm for scheduling independent tasks . AIIE Transactions , 3 : 239 – 245 . [CSA]
   Google Scholar