An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine

Published Online:https://doi.org/10.1287/ijoc.11.2.211

References

  • Bagchi U. Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems. Oper. Res. (1989) 37 118 125 LinkGoogle Scholar
  • Bagchi U. , Chang Y. L. , Sullivan R. S. Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date. Naval Res. Logist. (1987) 34 738 751 CrossrefGoogle Scholar
  • Baker K. R. , Scudder G. D. Sequencing with earliness and tardiness penalties: A review. Oper. Res. (1990) 38 22 36 LinkGoogle Scholar
  • Cai X. Minimization of agreeably weighted variance in single machine systems. Eur. J. Oper. Res. (1995) 85 576 592 CrossrefGoogle Scholar
  • De P. , Ghosh J. B. , Wells C. E. On the minimization of completion time variance with a bicriteria-extension. Oper. Res. (1992) 40 1148 1155 LinkGoogle Scholar
  • Eilon S. , Chowdhury I. G. Minimizing waiting variance in the single machine problem. Management Sci. (1977) 23 567 575 LinkGoogle Scholar
  • Hall N. G. , Kubiak W. Proof of a conjecture of schrage about the completion time variance problem. Oper. Res. Lett. (1991) 10 467 472 CrossrefGoogle Scholar
  • Ibarra O. , Kim C. E. Fast approximation algorithms for the Knapsack and sum of subset problems. J. ACM (1975) 22 463 468 CrossrefGoogle Scholar
  • Kanet J. J. Minimizing variation of flow time in single machine systems. Management Sci. (1981) 27 1453 1459 LinkGoogle Scholar
  • Kubiak W. Completion time variance on a single machine is difficult. Oper. Res. Lett. (1993) 14 49 59 CrossrefGoogle Scholar
  • Lawler E. L. Sequencing to minimize the weighted number of tardy jobs. RAIRO Recherche opérationelle (1976) S10 5 27 33 Google Scholar
  • Lawler E. L. Knapsack-like scheduling problems the moore-hodgson algorithm and the “tower of sets” property. Math. Comput. Model. (1994) 20 91 106 CrossrefGoogle Scholar
  • Merten A. G. , Muller M. E. Variance minimization in single machine sequencing problems. Management Sci. (1972) 18 518 528 LinkGoogle Scholar
  • Sahni S. K. Algorithms for scheduling independent tasks. J. ACM (1976) 23 116 127 CrossrefGoogle Scholar
  • Schrage L. Minimizing the time-in-system variance for a finite jobset. Management Sci. (1975) 21 540 543 LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.