Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 370656, 11 pages
http://dx.doi.org/10.1155/2014/370656
Research Article

Constraint Violations in Stochastically Generated Data: Detection and Correction Strategies

1Department of Accounting and Information Systems, Qatar University, P.O. Box 2713, Doha, Qatar
2Department of Computer and Information Science, Cleveland State University, Cleveland, OH 44114, USA

Received 9 August 2013; Accepted 19 October 2013; Published 4 February 2014

Academic Editors: P. Bala and Y.-P. Huang

Copyright © 2014 Adam Fadlalla and Toshinori Munakata. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. T. Munakata, Fundamentals of the New Artificial Intelligence: Neural, Evolutionary, Fuzzy and More, Springer, London, UK, 2nd edition, 2008.
  2. J. Du and J. Leung, “Minimizing total tardiness on one process is NP-hard,” Mathematics of Operations Research, vol. 3, pp. 483–495, 1990. View at Google Scholar
  3. C. Koulamas, “The single-machine total tardiness scheduling problem: review and extensions,” European Journal of Operational Research, vol. 202, no. 1, pp. 1–7, 2010. View at Publisher · View at Google Scholar · View at Scopus
  4. F. S. Hillier and G. J. Lieberman, Introduction to Operations Research, McGraw-Hill, New York, NY, USA, 8th edition, 2004.
  5. L. D. Landau and E. M. Lifshitz, Fluid Mechanics, vol. 6 of Course of Theoretical Physics, Butterworth-Heinemann, Oxford, UK, 2nd edition, 1987.
  6. T. Munakata and A. Fadlalla, “Constraint isomorphism and the generation of stochastic data,” IIE Transactions, vol. 38, no. 5, pp. 437–444, 2006. View at Publisher · View at Google Scholar · View at Scopus
  7. L. Wilkerson and J. Irwin, “An improved method for scheduling independent tasks,” AIIE Transactions, vol. 3, no. 3, pp. 239–245, 1971. View at Google Scholar · View at Scopus
  8. V. Srinivasan, “A hybrid algorithm for the one machine sequencing problem to minimize total tardiness,” Naval Research Logistics Quarterly, vol. 18, pp. 317–327, 1971. View at Google Scholar
  9. A. H. G. Rinnooy Kan, B. J. Lageweg, and J. K. Lenstra, “Minimizing total costs in one machine scheduling,” Operations Research, vol. 23, no. 5, pp. 908–927, 1975. View at Google Scholar · View at Scopus
  10. M. L. Fisher, “A dual algorithm for the one-machine scheduling problem,” Mathematical Programming, vol. 11, no. 1, pp. 229–251, 1976. View at Publisher · View at Google Scholar · View at Scopus
  11. C. L. Potts and L. N. Van Wassenhove, “Single machine sequencing heuristics,” IIE Transactions, vol. 23, pp. 346–354, 1991. View at Google Scholar
  12. H. A. J. Crauwels, C. N. Potts, and L. N. Van Wassenhove, “Local search heuristics for the single machine total weighted tardiness scheduling problem,” INFORMS Journal on Computing, vol. 10, no. 3, pp. 341–350, 1998. View at Google Scholar · View at Scopus
  13. R. Congram, C. N. Potts, and S. L. van de Velde, “An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem,” INFORMS Journal on Computing, vol. 14, pp. 52–67, 2002. View at Google Scholar
  14. L.-P. Bigras, M. Gamache, and G. Savard, “Time-indexed formulations and the total weighted tardiness problem,” INFORMS Journal on Computing, vol. 20, no. 1, pp. 133–142, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. C. N. Potts and L. N. Van Wassenhove, “A decomposition algorithm for the single machine total tardiness problem,” Operations Research Letters, vol. 1, no. 5, pp. 177–181, 1982. View at Google Scholar · View at Scopus
  16. C. Koulamas, “The total tardiness problem: review and extensions,” Operations Research, vol. 42, no. 6, pp. 1025–1041, 1994. View at Google Scholar · View at Scopus
  17. Y.-D. Kim, “Minimizing total tardiness in permutation flowshops,” European Journal of Operational Research, vol. 85, no. 3, pp. 541–555, 1995. View at Google Scholar · View at Scopus
  18. W. Szwarc and S. K. Mukhopadhyay, “Decomposition of the single machine total tardiness problem,” Operations Research Letters, vol. 19, no. 5, pp. 243–250, 1996. View at Publisher · View at Google Scholar · View at Scopus
  19. K. C. Tan and R. Narasimhan, “Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach,” Omega, vol. 25, no. 6, pp. 619–634, 1997. View at Google Scholar · View at Scopus
  20. N. G. Hall and M. E. Posner, “Generating experimental data for computational testing with machine scheduling applications,” Operations Research, vol. 49, no. 6, pp. 854–865, 2001. View at Google Scholar · View at Scopus
  21. T. Munakata and A. Fadlalla, “Constraint isomorphism and correction algorithms for violations,” PAMM, vol. 7, no. 1, pp. 2010031–2010032, 2007. View at Google Scholar
  22. D. P. Ronconi and L. R. S. Henriques, “Some heuristic algorithms for total tardiness minimization in a flowshop with blocking,” Omega, vol. 37, no. 2, pp. 272–281, 2009. View at Publisher · View at Google Scholar · View at Scopus
  23. W.-J. Chen, “Minimizing number of tardy jobs on a single machine subject to periodic maintenance,” Omega, vol. 37, no. 3, pp. 591–599, 2009. View at Publisher · View at Google Scholar · View at Scopus
  24. C. Koulamas, “Single-machine scheduling with time windows and earliness/tardiness penalties,” European Journal of Operational Research, vol. 91, no. 1, pp. 190–202, 1996. View at Publisher · View at Google Scholar · View at Scopus
  25. S. Goren, “Sabuncuoglu. Generating robust and stable schedules for a single machine environment under random machine breakdowns and processing time variability,” http://www.ie.bilkent.edu.tr/technicalpapers/Goren_Sabuncuoglu.pdf.
  26. A. Agnetis, A. Alfieri, and G. Nicosia, “Single-machine scheduling problems with generalized preemption,” INFORMS Journal on Computing, vol. 21, no. 1, pp. 1–12, 2009. View at Publisher · View at Google Scholar · View at Scopus