Advertisement

Scheduling Constraints

  • Jose M. Framinan
  • Rainer Leisten
  • Rubén Ruiz García
Chapter

Abstract

This chapter belongs to the part of the book devoted to scheduling models, one of the three elements (recall from Chap.  1 that the other two are methods and tools) that constitute an scheduling system.

Keywords

Setup Time Flow Shop Precedence Constraint Schedule Constraint Hybrid Flow Shop 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Adiri, I. and Pohoryles, D. (1982). Flowshop no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics, 29(3):495–504.Google Scholar
  2. Agnetis, A., Alfieri, A., and Nicosia, G. (2009). Single-machine scheduling problems with generalized preemption. INFORMS Journal on Computing, 21(1):1–12.Google Scholar
  3. Allahverdi, A., Gupta, J. N. D., and Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. OMEGA, The International Journal of Management Science, 27(2):219–239.Google Scholar
  4. Allahverdi, A., Ng, C. T., Cheng, T. C. E., and Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3):985–1032.Google Scholar
  5. Averbakh, I., Berman, O., and Chernykh, I. (2005). The \(m\)-machine flowshop problem with unit-time operations and intree precedence constraints. Operations Research Letters, 33(3):263–266.Google Scholar
  6. Baker, K. R. and Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: a review. Mathematics of Operations Research, 15:483–495.Google Scholar
  7. Bellanger, A. and Oulamara, A. (2009). Scheduling hybrid flowshop with parallel batching machines and compatibilities. Computers & Operations Research, 36(6):1982–1992.Google Scholar
  8. Bertel, S. and Billaut, J.-C. (2004). A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. European Journal of Operational Research, 159(3):651–662.Google Scholar
  9. Brucker, P., Heitmann, S., and Hurink, J. (2003). Flow-shop problems with intermediate buffers. OR Spectrum, 25(4):549–574.Google Scholar
  10. Brucker, P., Hilbig, T., and Hurink, J. (1999). A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. Discrete Applied Mathematics, 94 (1–3):77–99.Google Scholar
  11. Chang, Y. C. and Lee, C.-Y. (2004). Machine scheduling with job delivery coordination. European Journal of Operational Research, 158(2):470–487.Google Scholar
  12. Chen, Z.-L. (1996). Parallel machine scheduling with time dependent processing times. Discrete Applied Mathematics, 70(1):81–93.Google Scholar
  13. Chen, Z. L. and Vairaktarakis, G. L. (2005). Integrated scheduling of production and distribution operation. Management Science, 51(4):614–628.Google Scholar
  14. Cheng, T. C. E., Gupta, J. N. D., and Wang, G. Q. (2000). A review of flowshopn scheduling research with setup times. Production and Operations Management, 9(3):262–282.Google Scholar
  15. Choi, S. W., Kim, Y. D., and Lee, G. C. (2005). Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. International Journal of Production Research, 43(11):2149–2167.Google Scholar
  16. Crama, Y. and Spieksma, F. C. R. (1996). Scheduling jobs of equal length: Complexity, facets and computational results. Mathematical Programming, 72(3):207–227.Google Scholar
  17. Defersha, F. and Chen, M. (2012). Jobshop lot streaming with routing flexibility, sequence-dependent setups, machine release dates and lag time. International Journal of Production Research, 50(8):2331–2352.Google Scholar
  18. Eren, T. and Guner, E. (2009). A bicriteria parallel machine scheduling with a learning effect. International Journal of Advanced Manufacturing Technology, 40(11–12):1202–1205.Google Scholar
  19. Feldmann, M. and Biskup, D. (2008). Lot streaming in a multiple product permutation flow shop with intermingling. International Journal of Production Research, 46(1):197–216.Google Scholar
  20. Fondrevelle, J., Oulamara, A., and Portmann, M.-C. (2006). Permutation flowshop scheduling problems with maximal and minimal time lags. Computers & Operations Research, 33(6):1540–1556.Google Scholar
  21. Framinan, J. M., Gupta, J. N. D., and Leisten, R. (2004). A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society, 55(12):1243–1255.Google Scholar
  22. Gawiejnowicz, S. (2008). Time-Dependent Scheduling. Springer.Google Scholar
  23. Gupta, J. N. D. and Stafford, Jr, E. F. (2006). Flowshop scheduling research after five decades. European Journal of Operational Research, 169(3):699–711.Google Scholar
  24. Hall, N. G. and Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44(3):510–525.Google Scholar
  25. Hejazi, S. R. and Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research, 43(14):2895–2929.Google Scholar
  26. Hendel, Y., Runge, N., and Sourd, F. (2009). The one-machine just-in-time scheduling problem with preemption. Discrete Optimization, 6(1):10–22.Google Scholar
  27. Hou, S. and Hoogeveen, H. (2003). The three-machine proportionate flow shop problem with unequal machine speeds. Operations Research Letters, 31(3):225–231.Google Scholar
  28. Kubiak, W. and van de Velde, S. (1998). Scheduling deteriorating jobs to minimize makespan. Naval Research Logistics, 45(5):511–523.Google Scholar
  29. Lawler, E. L. (1973). Optimal Sequencing of a Single Machine Subject to Precedence Constraints. Management Science, 19(5):544–546.Google Scholar
  30. Lee, C.-Y. and Chen, Z.-L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4(1):3–24.Google Scholar
  31. Lee, C.-Y., Lei, L., and Pinedo, M. (1997). Current trends in deterministic scheduling. Annals of Operations Research, 70:1–41.Google Scholar
  32. Lee, C.-Y., Uzsoy, R., and Martin-Vega, L. A. (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40(4):764–775.Google Scholar
  33. Lee, W. C., Wu, C. C., and Sung, H. J. (2004). A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica, 40(4):303–315.Google Scholar
  34. Leisten, R. (1990). Flowshop sequencing problems with limited buffer storage. International Journal of Production Research, 28(11):2085.Google Scholar
  35. Leisten, R. and Kolbe, M. (1998). A note on scheduling jobs with missing operations in permutation flow shops. International Journal of Production Research, 36(9):2627–2630.Google Scholar
  36. Lenstra, J. K. and Rinnooy Kan, A. H. G. (1978). Complexity of Scheduling under Precedence Constraints. Operations Research, 26(1):22–35.Google Scholar
  37. Li, C. L., Vairaktarakis, G. L., and Lee, C.-Y. (2005). Machine scheduling with deliveries to multiple customer locations. European Journal of Operational Research, 164(1):39–51.Google Scholar
  38. Linn, R. and Zhang, W. (1999). Hybrid flow shop scheduling: A survey. Computers & Industrial Engineering, 37(1–2):57–61.Google Scholar
  39. Liua, Z., Yua, W., and Cheng, T. C. E. (1999). Scheduling groups of unit length jobs on two identical parallel machines. Information Processing Letters, 69(6):275–281.Google Scholar
  40. Lushchakova, I. N. and Kravchenko, S. A. (1998). Two-machine shop scheduling with zero and unit processing times. European Journal of Operational Research, 107(2):378–388.Google Scholar
  41. Maffioli, F. and Sciomachen, A. (1997). A mixed-integer model for solving ordering problems with side constraints. Annals of Operations Research, 69:277–297.Google Scholar
  42. Mascis, A. and Pacciarelli, D. (2005). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143(3):498–517.Google Scholar
  43. Naderi, B. and Ruiz, R. (2010). The distributed permutation flowshop scheduling problem. Computers & Operations Research, 37(4):754–768.Google Scholar
  44. Ow, P. S. (1985). Focused scheduling in proportionate flowshops. Management Science, 31(7):852–869.Google Scholar
  45. Pan, Q.-K. and Wang, L. (2008). A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems. European Journal of Industrial Engineering, 2(3):279–297.Google Scholar
  46. Papadimitriou, C. H. and Kanellakis, P. C. (1980). Flowshop scheduling with limited temporary-storage. Journal of the ACM, 27(3):533–549.Google Scholar
  47. Park, Y. B., Pegden, C., and Enscore, E. (1984). A survey and evaluation of static flowshop scheduling heuristics. International Journal of Production Research, 22(1):127–141.Google Scholar
  48. Pinedo, M. L. (2012). Scheduling: Theory, Algorithms, and Systems. Springer, New York, fourth edition.Google Scholar
  49. Potts, C. N. and Hall, N. G. (2003). Supply chain scheduling: Batching and delivery. Operations Research, 51(4):566–584.Google Scholar
  50. Potts, C. N. and Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120(2):222–249.Google Scholar
  51. Quadt, D. and Kuhn, D. (2007). A taxonomy of flexible flow line scheduling procedures. European Journal of Operational Research, 178(3):686–698.Google Scholar
  52. Ribas, I., Leisten, R., and Framinan, J. M. (2010). Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers & Operations Research, 37(8):1439–1454.Google Scholar
  53. Riezebos, J. and Gaalman, G. J. C. (1998). Time lag size in multiple operations flow shop scheduling heuristics. European Journal of Operational Research, 105(1):72–90.Google Scholar
  54. Ruiz, R. and Andres-Romano, C. (2011). Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup, times. 57(5–8):777–794.Google Scholar
  55. Ruiz, R. and Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2):479–494.Google Scholar
  56. Ruiz, R. and Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169(3):781–800.Google Scholar
  57. Ruiz, R., Vallada, E., and Fernández-Martínez, C. (2009). Scheduling in flowshopns with no-idle machines. In Chakraborty, U. K., editor, Computational Intelligence in Flow Shop and Job Shop Scheduling, volume 230 of Studies in Computational Intelligence, pages 21–51, Berlin. Springer-Verlag.Google Scholar
  58. Ruiz, R. and Vázquez-Rodríguez, J. A. (2010). The hybrid flowshop scheduling problem. European Journal of Operational Research, 205(1):1–18.Google Scholar
  59. Sarin, S. C. and Jaiprakash, P. (2007). Flow Shop Lot Streaming. Springer, New York.Google Scholar
  60. Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121(1):1–15.Google Scholar
  61. Sen, T. and Gupta, S. K. (1984). A state-of-art survey of static scheduling research involving due dates. OMEGA, The International Journal of Management Science, 12(1):63–76.Google Scholar
  62. Shabtay, D. and Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13):1643–1666.Google Scholar
  63. Sidney, J. B. (1975). Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs. Operations Research, 23(2):283–298.Google Scholar
  64. Turner, S. and Booth, D. (1987). Comparison of Heuristics for Flow Shop Sequencing. OMEGA, The International Journal of Management Science, 15(1):75–78.Google Scholar
  65. Urlings, T., Ruiz, R., and Sivrikaya-Şerifoğlu, F. (2010). Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems. International Journal of Metaheuristics, 1(1):30–54.Google Scholar
  66. Vachajitpan, P. (1982). Job sequencing with continuous machine operation. Computers & Industrial Engineering, 6(3):255–259.Google Scholar
  67. Vallada, E., Ruiz, R., and Minella, G. (2008). Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers & Operations Research, 35(4):1350–1373.Google Scholar
  68. Vignier, A., Billaut, J.-C., and Proust, C. (1999). Les problèmes d’ordonnancement de type flow-shop hybride: État de l’art. RAIRO Recherche opérationnelle, 33(2):117–183. In French.Google Scholar
  69. Wang, H. (2005). Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Systems, 22(2):78–85.Google Scholar
  70. Yang, W.-H. and Liao, C.-J. (1999). Survey of scheduling research involving setup times. International Journal of Systems Science, 30(2):143–155.Google Scholar
  71. Yeung, W.-K., Oğuz, C., and Cheng, T.-C. E. (2009). Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs. Naval Research Logistics, 56(7):593–599.Google Scholar

Copyright information

© Springer-Verlag London 2014

Authors and Affiliations

  • Jose M. Framinan
    • 1
  • Rainer Leisten
    • 2
  • Rubén Ruiz García
    • 3
  1. 1.Departamento Organización Industrial y Gestión de EmpresasUniversidad de Sevilla Escuela Superior de IngenierosIsla de la CartujaSpain
  2. 2.Fakultät für Ingenieurwissenschaften Allgemeine Betriebswirtschaftslehre und Operations ManagementUniversität Duisburg-EssenDuisburgGermany
  3. 3.Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de InformáticaUniversitat Politècnica de ValènciaValenciaSpain

Personalised recommendations