Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 273567, 14 pages
http://dx.doi.org/10.1155/2014/273567
Research Article

The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures

Department of Industrial Engineering, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia

Received 13 April 2014; Revised 8 October 2014; Accepted 14 October 2014; Published 26 November 2014

Academic Editor: Yuri N. Sotskov

Copyright © 2014 Anis Gharbi et al. 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. S. Pugazhendhi, S. Thiagarajan, C. Rajendran, and N. Anantharaman, “Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems,” Computers & Industrial Engineering, vol. 44, no. 1, pp. 133–157, 2003. View at Publisher · View at Google Scholar · View at Scopus
  2. R. Swaminathan, M. E. Pfund, J. W. Fowler, S. J. Mason, and A. Keha, “Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times,” Computers & Operations Research, vol. 34, no. 10, pp. 3055–3068, 2007. View at Publisher · View at Google Scholar · View at Scopus
  3. C. N. Potts, D. B. Shmoys, and D. P. Williamson, “Permutation vs. non-permutation flow shop schedules,” Operations Research Letters, vol. 10, no. 5, pp. 281–284, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. M. I. Sviridenko, “A note on permutation flow shop problem,” Annals of Operations Research, vol. 129, pp. 247–252, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. S. M. Johnson, “Optimal two- and three-stage production schedules with setup times included,” Naval Research Logistics Quarterly, vol. 1, no. 1, pp. 61–68, 1954. View at Publisher · View at Google Scholar
  7. M. R. Garey, D. S. Johnson, and R. Sethi, “The complexity of flowshop and jobshop scheduling,” Mathematics of Operations Research, vol. 1, no. 2, pp. 117–129, 1976. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. E. Ignall and L. Schrage, “Application of the branch and bound technique to some flow-shop scheduling problems,” Operations Research, vol. 13, no. 3, pp. 400–412, 1965. View at Publisher · View at Google Scholar · View at MathSciNet
  9. L. Lomnicki, “A branch and bound algorithm for the exact solution of the three-machine scheduling problem,” Operational Research Quarterly, vol. 16, no. 1, pp. 89–100, 1965. View at Google Scholar
  10. J. Grabowski, “On two-machine scheduling with release dates to minimize maximum lateness,” Operations Research, vol. 17, pp. 133–154, 1980. View at Google Scholar
  11. J. Carlier and I. Rebaï, “Two branch and bound algorithms for the permutation flow shop problem,” European Journal of Operational Research, vol. 90, no. 2, pp. 238–251, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. J. Cheng, H. Kise, and H. Matsumoto, “A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem,” European Journal of Operational Research, vol. 96, no. 3, pp. 578–590, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. M. Haouari and T. Ladhari, “A computational study of the permutation flow shop problem based on a tight lower bound,” Computers and Operations Research, vol. 32, no. 7, pp. 1831–1847, 2005. View at Publisher · View at Google Scholar · View at Scopus
  14. R. Ruiz and C. Maroto, “A comprehensive review and evaluation of permutation flowshop heuristics,” European Journal of Operational Research, vol. 165, no. 2, pp. 479–494, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. M. Nawaz, E. E. Enscore Jr., and I. Ham, “A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem,” Omega, vol. 11, no. 1, pp. 91–95, 1983. View at Publisher · View at Google Scholar · View at Scopus
  16. M. Haouari and T. Ladhari, “A branch-and-bound-based local search method for the flow shop problem,” Journal of the Operational Research Society, vol. 54, no. 10, pp. 1076–1084, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. I. H. Osman and C. N. Potts, “Simulated annealing for permutation flow-shop scheduling,” Omega, vol. 17, no. 6, pp. 551–557, 1989. View at Publisher · View at Google Scholar · View at Scopus
  18. C. R. Reeves, “Improving the efficiency of tabu search for machine sequencing problems,” Journal of the Operational Research Society, vol. 44, no. 4, pp. 375–382, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  19. E. Nowicki and C. Smutnicki, “A fast taboo search algorithm for the job shop problem,” Management Science, vol. 42, no. 6, pp. 797–813, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  20. H. Fisher and G. L. Thompson, “Probabilistic learning combinations of local job-shop scheduling rules,” in Industrial Scheduling, J. F. Muth and G. L. Thompson, Eds., pp. 225–251, Prentice Hall, Englewood Cliffs, NJ, USA, 1963. View at Google Scholar
  21. P. Brucker, S. A. Kravchenko, and Y. N. Sotskov, “On the complexity of two machine job-shop scheduling with regular objective functions,” Operations-Research-Spektrum, vol. 19, no. 1, pp. 5–10, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. P. Brucker, S. A. Kravchenko, and Y. N. Sotskov, “Preemptive job-shop scheduling problems with a fixed number of jobs,” Mathematical Methods of Operations Research, vol. 49, no. 1, pp. 41–76, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. P. Brucker, Y. N. Sotskov, and F. Werner, “Complexity of shop-scheduling problems with fixed number of jobs: a survey,” Mathematical Methods of Operations Research, vol. 65, no. 3, pp. 461–481, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  24. J. Carlier and E. Pinson, “An algorithm for solving the job-shop problem,” Management Science, vol. 35, no. 2, pp. 164–176, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  25. P. Brucker, B. Jurisch, and B. Sievers, “A branch and bound algorithm for the job-shop scheduling problem,” Discrete Applied Mathematics, vol. 49, no. 1–3, pp. 107–127, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. W. Brinkkötter and P. Brucker, “Solving open benchmark instances for the job-shop problem by parallel head–tail adjustments,” Journal of Scheduling, vol. 4, no. 1, pp. 53–64, 2001. View at Publisher · View at Google Scholar
  27. J. Adams, E. Balas, and D. Zawack, “The shifting bottleneck procedure for job shop scheduling,” Management Science, vol. 34, no. 3, pp. 391–401, 1988. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. S. Dauzere-Peres and J.-B. Lasserre, “A modified shifting bottleneck procedure for job-shop scheduling,” International Journal of Production Research, vol. 31, no. 4, pp. 923–932, 1993. View at Publisher · View at Google Scholar · View at Scopus
  29. E. Balas, J. K. Lenstra, and A. Vazacopoulos, “The one-machine problem with delayed precedence constraints and its use in job shop scheduling,” Management Science, vol. 41, no. 1, pp. 94–109, 1995. View at Publisher · View at Google Scholar · View at Scopus
  30. H. Wenqi and Y. Aihua, “An improved shifting bottleneck procedure for the job shop scheduling problem,” Computers & Operations Research, vol. 31, no. 12, pp. 2093–2110, 2004. View at Publisher · View at Google Scholar · View at Scopus
  31. V. A. Armentano and C. R. Scrich, “Tabu search for minimizing total tardiness in a job shop,” International Journal of Production Economics, vol. 63, no. 2, pp. 131–140, 2000. View at Publisher · View at Google Scholar · View at Scopus
  32. E. Nowicki and C. Smutnicki, “New algorithm for the jobshop problem,” Tech. Rep., Institute of Engineering Cybernetics, Wroclaw University of Technology, Wroclaw, Poland, 2003. View at Google Scholar
  33. R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass, USA, 1967. View at MathSciNet
  34. C. L. Monma and A. H. G. Rinnooy Kan, “A concise survey of efficiently solvable special cases of the permutation flow-shop problem,” RAIRO Recherche Opérationnelle, vol. 17, no. 2, pp. 105–119, 1983. View at Google Scholar · View at MathSciNet
  35. A. H. G. R. Kan, Machine Scheduling Problems: Classification, Complexity and Computations, Nijhoff, The Hague, The Netherlands, 1976.
  36. J. K. Lenstra, Sequencing by Enumerative Methods, vol. 69 of Mathematical Center Tracts, Mathematisch Centrum, Amsterdam, The Netherlands, 1977. View at MathSciNet
  37. M. Dell'Amico, “Shop problems with two machines and time Lags,” Operations Research, vol. 44, no. 5, pp. 777–787, 1996. View at Publisher · View at Google Scholar · View at Scopus
  38. D. Rebaine, “Flow shop vs. permutation shop with time delays,” Computers and Industrial Engineering, vol. 48, no. 2, pp. 357–362, 2005. View at Publisher · View at Google Scholar · View at Scopus
  39. B. Benson and M. Dror, “Linear time procedure for the two job flowshop,” Foundations of Computing and Decision Sciences, vol. 23, no. 3, pp. 179–186, 1998. View at Google Scholar · View at MathSciNet
  40. J. Carlier and E. Pinson, “Adjustment of heads and tails for the job-shop problem,” European Journal of Operational Research, vol. 78, no. 2, pp. 146–161, 1994. View at Publisher · View at Google Scholar · View at Scopus
  41. P. Brucker, B. Jurisch, and A. Kramer, “The job-shop problem and immediate selection,” Annals of Operations Research, vol. 50, pp. 73–114, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  42. J. Carlier and E. Pinson, “A practical use of Jackson's Preemptive Schedule for solving job-shop problem,” Annals of Operations Research, vol. 26, no. 1–4, pp. 269–287, 1990. View at Google Scholar · View at MathSciNet
  43. J. R. Jackson, “Scheduling a production line to minimize maximum tardiness,” Management Science Research Project, University of California, Los Angeles, Calif, USA, 1955. View at Google Scholar
  44. M. Haouari and A. Gharbi, “An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines,” Operations Research Letters, vol. 31, no. 1, pp. 49–52, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  45. J. Carlier, “The one-machine sequencing problem,” European Journal of Operational Research, vol. 11, no. 1, pp. 42–47, 1982. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus