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

A Scheduling Problem in the Baking Industry

1Department of Applied Mathematics, Institute of Mathematics, Statistics and Scientific Computing, State University of Campinas, Campinas, SP, Brazil
2School of Applied Sciences, State University of Campinas, Limeira, SP, Brazil

Received 5 December 2013; Revised 29 April 2014; Accepted 29 April 2014; Published 19 June 2014

Academic Editor: Nachamada Blamah

Copyright © 2014 Felipe Augusto Moreira da Silva 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. H. L. Gantt, Work, Wages, and Profits, Engineering Magazine, New York, NY, USA, 1916.
  2. 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
  3. R. Bellman, “The theory of dynamic programming,” Bulletin of the American Mathematical Society, vol. 60, no. 6, pp. 503–515, 1954. View at Publisher · View at Google Scholar
  4. Z. A. Lomnicki, “A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem,” Operational Research Quarterly, vol. 16, pp. 89–100, 1965. View at Publisher · View at Google Scholar
  5. E. Ignall and L. Schrage, “Application of the branch -and-bound technique to some flowshop scheduling problems,” Operations Research, vol. 13, no. 3, pp. 400–412, 1965. View at Google Scholar
  6. J. D. C. Little, K. G. Murty, D. W. Sweeney, and C. Karel, “An algorithm for the traveling salesman problem,” Operations Research, vol. 11, no. 6, pp. 972–989, 1963. 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
  8. J. Sridhar and C. Rajendran, “Scheduling in a cellular manufacturing system: a simulated annealing approach,” International Journal of Production Research, vol. 31, no. 12, pp. 2927–2945, 1993. View at Publisher · View at Google Scholar
  9. C. Rajendran and H. Ziegler, “Heuristics for scheduling in flowshops and owline-based manufacturing cells to minimize the sum of weighted owtime and weighted tardiness of jobs,” Computers & Industrial Engineering, vol. 37, no. 4, pp. 671–690, 1999. View at Publisher · View at Google Scholar
  10. J. E. Schaller, J. N. D. Gupta, and A. J. Vakharia, “Scheduling a flowline manufacturing cell with sequence dependent family setup times,” European Journal of Operational Research, vol. 125, no. 2, pp. 324–339, 2000. View at Publisher · View at Google Scholar
  11. J. Schaller, “A new lower bound for the flow shop group scheduling problem,” Computers & Industrial Engineering, vol. 41, no. 2, pp. 151–161, 2001. View at Publisher · View at Google Scholar
  12. P. M. França, J. N. D. Gupta, A. S. Mendes, P. Moscato, and K. J. Veltink, “Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups,” Computers & Industrial Engineering, vol. 48, no. 3, pp. 491–506, 2005. View at Publisher · View at Google Scholar
  13. S. H. Hendizadeh, H. Faramarzi, S. A. Mansouri, J. N. D. Gupta, and T. Y. ElMekkawy, “Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times,” International Journal of Production Economics, vol. 111, no. 2, pp. 593–605, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. F. D. Croce, R. Tadei, and G. Volta, “A genetic algorithm for the job shop problem,” Computers & Operations Reseach, vol. 22, no. 1, pp. 15–24, 1995. View at Publisher · View at Google Scholar
  15. 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
  16. C. H. Dagli and S. Sittisathanchai, “Genetic neuro-scheduler: a new approach for job shop scheduling,” International Journal of Production Economics, vol. 41, no. 1–3, pp. 135–145, 1995. View at Publisher · View at Google Scholar
  17. T. S. Arthanari and K. G. Ramaswamy, “An extension of two machine sequencing problem,” Operation Research, vol. 8, pp. 10–22, 1971. View at Google Scholar
  18. S. A. Brah and J. L. Hunsucker, “Branch and bound algorithm for the flowshop with multiple processors,” European Journal of Operational Research, vol. 51, no. 1, pp. 88–99, 1991. View at Publisher · View at Google Scholar
  19. T. J. Sawik, “A scheduling algorithm for flexible flow lines with limited intermediate buffers,” Applied Stochastic Models and Data Analysis, vol. 9, no. 2, pp. 127–138, 1993. View at Publisher · View at Google Scholar
  20. F.-Y. Ding and D. Kittichartphayak, “Heuristics for scheduling flexible flow lines, computers,” Industrial Engineering, vol. 26, no. 1, pp. 27–34, 1994. View at Publisher · View at Google Scholar
  21. A. Guinet, M. M. Solomon, P. K. Kedia, and A. Dussauchoy, “A computational study of heuristics for two-stage flexible flowshops,” International Journal of Production Research, vol. 34, no. 5, pp. 1399–1415, 1996. View at Publisher · View at Google Scholar
  22. E. Nowicki and C. Smutnicki, “The flow shop with parallel machines: a tabu search approach,” European Journal of Operational Research, vol. 106, no. 2-3, pp. 226–253, 1998. View at Publisher · View at Google Scholar
  23. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, “Greedy algorithms,” in Introduction to Algorithms, pp. 379–399, MIT Press, Cambridge, Mass, USA, 2001. View at Google Scholar
  24. G. Bendall and F. Margot, “Greedy type resistance of combinatorial problems,” Discrete Optimization, vol. 3, no. 4, pp. 288–298, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook, The Travelling Salesman Problem: A Computational Study, Princeton University Press, Princeton, NJ, USA, 2006.
  26. A. Allahverdi, C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov, “A survey of scheduling problems with setup times or costs,” European Journal of Operational Research, vol. 187, no. 3, pp. 985–1032, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  27. F. A. M. da Silva, The application of scheduling in the industry [M.S. dissertation], University of Campinas, São Paulo, Brazil, 2011.