Skip to main content
Have a personal or library account? Click to login
Batch Scheduling In A Two-Stage Flexible Flow Shop Problem Cover

Batch Scheduling In A Two-Stage Flexible Flow Shop Problem

Foundations of Computing and Decision Sciences
Volume 39 (2014): Issue 1 (February 2014)
By: ,   and    
Open Access
|Mar 2014
References

References

  1. [1] Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y., A survey of scheduling problems with setup times or costs. European Journal of Operational Research,, 2008, 985-1032.
    Open DOISearch in Google Scholar
  2. [2] Baptiste, P., Brucker, P., Scheduling equal processing time jobs. In: Leung J.Y.T. (Ed.), Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapman & HALL/CRC, 2004.
    Search in Google Scholar
  3. [3] Cao, D., Chen, M., Wan, G., Parallel machine selection and job scheduling to minimize machine cost and job tardiness, Computers & Operations Research,, 2005, 1995-2012.
    Open DOISearch in Google Scholar
  4. [4] Chen, Z.L., Li, C.L., Scheduling with subcontracting options. IIE Transactions,, 2008, 1171-1184.
    Open DOISearch in Google Scholar
  5. [5] Cheng, T.C.E., Kovalyov, M.Y., An exact algorithm for batching and scheduling two part types in a mixed shop: A technical note, International Journal of Production Economics,, 1998, 53-56.
    Open DOISearch in Google Scholar
  6. [6] Cheng, T.C.E., Kovalyov, M.Y., Chakhlevich, K.N., Batching in a two-stage flowshop with dedicated machines in second stage. IIE Transactions,, 2004, 87-93.
    Open DOISearch in Google Scholar
  7. [7] Fanjul-Peyro, L., Ruiz, R., Scheduling unrelated parallel machines with optional machines and jobs selection, Computers and Operational Research,, 2012, 1745-1753.
    Open DOISearch in Google Scholar
  8. [8] Finke, G., Lemaire, P., Proth, J. M., Queyranne, M., Minimizing the number of machines for minimum length schedules, European Journal of Operational Research,, 2009, 702-705.
    Open DOISearch in Google Scholar
  9. [9] Gerstl, E., Mosheiov, G., A two-stage flow shop scheduling with a critical machine and batch availability, Foundations of Computing and Decision Sciences,, 2012, 39-56.
    Open DOISearch in Google Scholar
  10. [10] Gerstl, E., Mosheiov, G., The optimal number of used machines in a two-stage flexible flowshop scheduling problem, Journal of Scheduling, 2013, DOI 10.1007/s10951-013-0343-z.
    Open DOISearch in Google Scholar
  11. [11] Hoogeveen J.A., Lenstra, J.K., Veltman, B., Preemptive scheduling in a two-stage multi-processor flow-shop is NP-hard, European Journal of Operational Research,, 1996, 172-175.
    Open DOISearch in Google Scholar
  12. [12] Kravchenko, S.A., Werner, F., Minimizing the number of machines for scheduling jobs with equal processing times, European Journal of Operational Research,, 2009, 595-600.
    Open DOISearch in Google Scholar
  13. [13] Kravchenko, S.A., Werner, F., Parallel machine problems with equal processing times: a survey, Journal of Scheduling,, 2011, 435-444.
    Open DOISearch in Google Scholar
  14. [14] Kyparisis, G.J., Koulamas, C., Flow shop and open shop scheduling with a critical machine and two operations per job, European Journal of Operational Research,, 2000, 120-125.
    Open DOISearch in Google Scholar
  15. [15] Lee C.-Y., Vairaktarakis, G.L., Performance comparison of some classes of flexible flowshops and jobshops, The International Journal of Flexible Manufacturing Systems,, 1998, 379-405.
    Open DOISearch in Google Scholar
  16. [16] Lin, M.T.B., The strong NP-hardness of two-stage flowshop scheduling with common second-stage machine. Computers and Operations Research,, 1999, 695-69.
    Open DOISearch in Google Scholar
  17. [17] Lin, H.-T., Liao, C.-J., A case study in a two-stage hybrid flow shop with setup time and dedicated machines, International Journal of Production Economics,, 2003, 133-143.
    Open DOISearch in Google Scholar
  18. [18] Monma, C.L., Potts, C.N., On the complexity of scheduling with batch setup times.Operations Research,, 1989, 789-804.
    Open DOISearch in Google Scholar
  19. [19] Mosheiov, G., Oron, D., A note on flow-shop and job-shop batch scheduling with identical processing-time jobs, European Journal of Operational Research,, 2005, 285-291.
    Open DOISearch in Google Scholar
  20. [20] Mosheiov, G., Oron, D., Ritov, Y., Minimizing flowtime on a single machine with integer batch sizes, Operations Research Letters,, 2005, 497-501.
    Open DOISearch in Google Scholar
  21. [21] Mosheiov, G., Yovel, U., Comments on “Flow shop and open shop scheduling with critical machine and two operations per job”, European Journal of Operational Research,, 2004, 257-261.
    Open DOISearch in Google Scholar
  22. [22] Oguz, C., Ercan, M.F., A Genetic Algorithm for Hybrid Flow-Shop Scheduling with Multiprocessor Tasks, Journal of Scheduling,, 2005, 323-351.
    Open DOISearch in Google Scholar
  23. [23] Oguz, C., Lin, M.T.B., Cheng, T. C. E., Two-stage scheduling with a common secondstage machine, Computers and Operations Research,, 1997, 1169-1174.
    Open DOISearch in Google Scholar
  24. [24] Pinedo, M., Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, 1995.
    Search in Google Scholar
  25. [25] Ruiz, R., Vazquez-Rodriguez, J.A., The hybrid flow shop scheduling problem, European Journal of Operational Research,, 2010, 1-18.
    Open DOISearch in Google Scholar
DOI: https://doi.org/10.2478/fcds-2014-0001 | Journal eISSN: 2300-3405 (formerly 0867-6356) | Journal ISSN: 0867-6356
Journal RSS Feed
Language: English
Page range: 3 - 16
Published on: Mar 11, 2014
Published by: Poznan University of Technology
In partnership with: Paradigm Publishing Services
Keywords:
Deterministic Scheduling,
Flexible Flowshop,
Batch Scheduling
Related subjects:
Computer sciences,
Software development

© 2014 Enrique Gerstl, Gur Mosheiov, Assaf Sarig, published by Poznan University of Technology
This work is licensed under the Creative Commons License.

Volume 39 (2014): Issue 1 (February 2014)
Next article