IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v246y2015i2p345-378.html
   My bibliography  Save this article

The third comprehensive survey on scheduling problems with setup times/costs

Author

Listed:
  • Allahverdi, Ali

Abstract

Scheduling involving setup times/costs plays an important role in today's modern manufacturing and service environments for the delivery of reliable products on time. The setup process is not a value added factor, and hence, setup times/costs need to be explicitly considered while scheduling decisions are made in order to increase productivity, eliminate waste, improve resource utilization, and meet deadlines. However, the vast majority of existing scheduling literature, more than 90 percent, ignores this fact. The interest in scheduling problems where setup times/costs are explicitly considered began in the mid-1960s and the interest has been increasing even though not at an anticipated level. The first comprehensive review paper (Allahverdi et al., 1999) on scheduling problems with setup times/costs was in 1999 covering about 200 papers, from mid-1960s to mid-1988, while the second comprehensive review paper (Allahverdi et al., 2008) covered about 300 papers which were published from mid-1998 to mid-2006. This paper is the third comprehensive survey paper which provides an extensive review of about 500 papers that have appeared since the mid-2006 to the end of 2014, including static, dynamic, deterministic, and stochastic environments. This review paper classifies scheduling problems based on shop environments as single machine, parallel machine, flowshop, job shop, or open shop. It further classifies the problems as family and non-family as well as sequence-dependent and sequence-independent setup times/costs. Given that so many papers have been published in a relatively short period of time, different researchers have addressed the same problem independently, by even using the same methodology. Throughout the survey paper, the independently addressed problems are identified, and need for comparing these results is emphasized. Moreover, based on performance measures, shop and setup times/costs environments, the less studied problems have been identified and the need to address these problems is specified. The current survey paper, along with those of Allahverdi et al. (1999, 2008), is an up to date survey of scheduling problems involving static, dynamic, deterministic, and stochastic problems for different shop environments with setup times/costs since the first research on the topic appeared in the mid-1960s.

Suggested Citation

  • Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
  • Handle: RePEc:eee:ejores:v:246:y:2015:i:2:p:345-378
    DOI: 10.1016/j.ejor.2015.04.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715002763
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2015.04.004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Xi, Yue & Jang, Jaejin, 2012. "Scheduling jobs on identical parallel machines with unequal future ready time and sequence dependent setup: An experimental study," International Journal of Production Economics, Elsevier, vol. 137(1), pages 1-10.
    2. D Lu & R Logendran, 2013. "Bi-criteria group scheduling with sequence-dependent setup time in a flow shop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(4), pages 530-546, April.
    3. Chen, Yin-Yann & Cheng, Chen-Yang & Wang, Li-Chih & Chen, Tzu-Li, 2013. "A hybrid approach based on the variable neighborhood search and particle swarm optimization for parallel machine scheduling problems—A case study for solar cell industry," International Journal of Production Economics, Elsevier, vol. 141(1), pages 66-78.
    4. Yun-fang Peng, 2013. "Job Shop Scheduling with Sequence-Dependent Setup Times Based on Constraint Programming Approach," Springer Books, in: Runliang Dou (ed.), Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012), edition 127, chapter 0, pages 835-841, Springer.
    5. T Ladhari & M K Msakni & A Allahverdi, 2012. "Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(4), pages 445-459, April.
    6. Taha Keshavarz & Nasser Salmasi, 2014. "Efficient upper and lower bounding methods for flowshop sequence-dependent group scheduling problems," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 8(3), pages 366-387.
    7. Shih-Wei Lin & Zne-Jung Lee & Kuo-Ching Ying & Rong-Ho Lin, 2011. "Meta-heuristic algorithms for wafer sorting scheduling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 165-174, January.
    8. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    9. Yazdani Sabouni, M.T. & Logendran, Rasaratnam, 2013. "Carryover sequence-dependent group scheduling with the integration of internal and external setup times," European Journal of Operational Research, Elsevier, vol. 224(1), pages 8-22.
    10. Taha Keshavarz & Nasser Salmasi & Mohsen Varmazyar, 2015. "Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem," Annals of Operations Research, Springer, vol. 226(1), pages 351-377, March.
    11. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
    12. Yang, Wen-Hua & Chand, Suresh, 2008. "Learning and forgetting effects on a group scheduling problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1033-1044, June.
    13. Koulamas, Christos & Kyparisis, George J., 2008. "Single-machine scheduling with waiting-time-dependent due dates," European Journal of Operational Research, Elsevier, vol. 191(2), pages 577-581, December.
    14. Hamed Hendizadeh, S. & Faramarzi, Hamidreza & Mansouri, S.Afshin & Gupta, Jatinder N.D. & Y ElMekkawy, Tarek, 2008. "Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times," International Journal of Production Economics, Elsevier, vol. 111(2), pages 593-605, February.
    15. Nickolas K. Freeman & John Mittenthal & Sharif H. Melouk, 2014. "Parallel-machine scheduling to minimize overtime and waste costs," IISE Transactions, Taylor & Francis Journals, vol. 46(6), pages 601-618, June.
    16. C-C He & C-C Wu & W-C Lee, 2009. "Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1759-1766, December.
    17. Changkyu Park & Junyong Seo, 2013. "A GRASP approach to transporter scheduling for ship assembly block operations management," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(3), pages 312-332.
    18. H.M. Soroush, 2012. "Solving the single machine scheduling problem with general job-dependent past-sequence-dependent setup times and learning effects," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(5), pages 596-628.
    19. B. Naderi & Nasser Salmasi, 2012. "Permutation flowshops in group scheduling with sequence-dependent setup times," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(2), pages 177-198.
    20. Anghinolfi, Davide & Paolucci, Massimo, 2009. "A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 193(1), pages 73-85, February.
    21. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    22. Tang, Lixin & Huang, Lin, 2007. "Optimal and near-optimal algorithms to rolling batch scheduling for seamless steel tube production," International Journal of Production Economics, Elsevier, vol. 105(2), pages 357-371, February.
    23. Rajesh Vanchipura & R. Sridharan, 2014. "Development and analysis of hybrid genetic algorithms for flow shop scheduling with sequence dependent setup time," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 17(2), pages 168-193.
    24. Pereira Lopes, Manuel J. & de Carvalho, J.M. Valerio, 2007. "A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1508-1527, February.
    25. Pang, King-Wah, 2013. "A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness," International Journal of Production Economics, Elsevier, vol. 141(1), pages 127-136.
    26. Biskup, Dirk & Herrmann, Jan, 2008. "Single-machine scheduling against due dates with past-sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 191(2), pages 587-592, December.
    27. Jennifer L. Loveland & Susan K. Monkman & Douglas J. Morrice, 2007. "Dell Uses a New Production-Scheduling Algorithm to Accommodate Increased Product Variety," Interfaces, INFORMS, vol. 37(3), pages 209-219, June.
    28. Asiye Aydilek & Harun Aydilek & Ali Allahverdi, 2015. "Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan," International Journal of Production Research, Taylor & Francis Journals, vol. 53(9), pages 2803-2819, May.
    29. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    30. Mehravaran, Yasaman & Logendran, Rasaratnam, 2012. "Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 135(2), pages 953-963.
    31. H M Soroush, 2014. "Scheduling in bicriteria single machine systems with past-sequence-dependent setup times and learning effects," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(7), pages 1017-1036, July.
    32. Arezoo Atighehchian & Mohammad Mehdi Sepehri, 2013. "An environment-driven, function-based approach to dynamic single-machine scheduling," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(1), pages 100-118.
    33. Moacir Godinho Filho & Márcia De Fátima Morais & Thays Josyane Perassoli Boiko & Hugo Hissashi Miyata & Fernando Willian Rodrigues Varolo, 2013. "Scheduling in flow shop with sequence-dependent setup times: literature review and analysis," International Journal of Business Innovation and Research, Inderscience Enterprises Ltd, vol. 7(4), pages 466-486.
    34. Shijin Wang, 2014. "ACO-based method for single machine scheduling with sequence-dependent setup time and limited capacity warehouse," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 16(3), pages 334-364.
    35. Kacem, Imed & Chu, Chengbin, 2008. "Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1080-1089, June.
    36. Yunqiang Yin & Chin-Chia Wu & Wen-Hung Wu & Juei-Chao Chen, 2013. "Single-machine group scheduling with a general learning effect," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(3), pages 350-369.
    37. Rossi, Andrea, 2014. "Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships," International Journal of Production Economics, Elsevier, vol. 153(C), pages 253-267.
    38. J-G Kim & D-H Lee, 2009. "Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1264-1272, September.
    39. Venditti, Luca & Pacciarelli, Dario & Meloni, Carlo, 2010. "A tabu search algorithm for scheduling pharmaceutical packaging operations," European Journal of Operational Research, Elsevier, vol. 202(2), pages 538-546, April.
    40. Wu, Chin-Chia & Lee, Wen-Chiung, 2008. "Single-machine group-scheduling problems with deteriorating setup times and job-processing times," International Journal of Production Economics, Elsevier, vol. 115(1), pages 128-133, September.
    41. Koulamas, Christos & Kyparisis, George J., 2008. "Single-machine scheduling problems with past-sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1045-1049, June.
    42. S H Chung & W L Pearn & Y T Tai, 2009. "Fast and effective algorithms for the liquid crystal display module (LCM) scheduling problem with sequence-dependent setup time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 921-933, July.
    43. Allahverdi, Ali & Aydilek, Harun, 2014. "Total completion time with makespan constraint in no-wait flowshops with setup times," European Journal of Operational Research, Elsevier, vol. 238(3), pages 724-734.
    44. Rajesh Vanchipura & R. Sridharan, 2013. "Impact of varying levels of setup time on the performance of algorithms for scheduling a flow shop with sequence dependent setup time," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 14(4), pages 421-444.
    45. Cédric Pessan & Emmanuel Néron & Mohamed Haouari, 2013. "Development of lower bounds for the scheduling of setup tasks in serial production lines," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(5), pages 558-576.
    46. Hanen Akrout & Bassem Jarboui & Patrick Siarry & Abdelwaheb Rebaï, 2012. "A GRASP based on DE to solve single machine scheduling problem with SDST," Computational Optimization and Applications, Springer, vol. 51(1), pages 411-435, January.
    47. Luo, Xiaochuan & Chu, Chengbin, 2007. "A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness," European Journal of Operational Research, Elsevier, vol. 180(1), pages 68-81, July.
    48. Cheng-Dar Liou & Yi-Chih Hsieh & Yin-Yann Chen, 2013. "A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem," International Journal of Systems Science, Taylor & Francis Journals, vol. 44(1), pages 77-93.
    49. N Nekoiemehr & G Moslehi, 2011. "Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1403-1412, July.
    50. Allahverdi, Ali & Soroush, H.M., 2008. "The significance of reducing setup times/setup costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 978-984, June.
    51. Armentano, Vinicius Amaral & de Franca Filho, Moacir Felizardo, 2007. "Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach," European Journal of Operational Research, Elsevier, vol. 183(1), pages 100-114, November.
    52. F Jin & J N D Gupta & S Song & C Wu, 2010. "Single machine scheduling with sequence-dependent family setups to minimize maximum lateness," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1181-1189, July.
    53. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    54. W L Pearn & S H Chung & M H Yang & K P Shiao, 2008. "Solution strategies for multi-stage wafer probing scheduling problem with reentry," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 637-651, May.
    55. H.M. Soroush, 2014. "Stochastic bicriteria single machine scheduling with sequence-dependent job attributes and job-dependent learning effects," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 8(4), pages 421-456.
    56. Choobineh, F. Fred & Mohebbi, Esmail & Khoo, Hansen, 2006. "A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 175(1), pages 318-337, November.
    57. V. Mani & Pei-Chann Chang & Shih-Hsin Chen, 2011. "Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis," International Journal of Systems Science, Taylor & Francis Journals, vol. 42(12), pages 2097-2102.
    58. Xuefeng Yu & Bala Ram & Xiaochun Jiang, 2007. "Parameter setting in a bio-inspired model for dynamic flexible job shop scheduling with sequence-dependent setups," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 1(2), pages 182-199.
    59. Nicolau Santos & Rui Rebelo & João Pedro Pedroso, 2014. "A tabu search for the permutation flow shop problem with sequence dependent setup times," International Journal of Data Analysis Techniques and Strategies, Inderscience Enterprises Ltd, vol. 6(3), pages 275-285.
    60. Monkman, Susan K. & Morrice, Douglas J. & Bard, Jonathan F., 2008. "A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1100-1114, June.
    61. Shih-Wei Lin & Kuo-Ching Ying, 2012. "Scheduling a bi-criteria flowshop manufacturing cell with sequence-dependent family setup times," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(4), pages 474-496.
    62. S. Hamed Hendizadeh & Tarek Y. ElMekkawy & G. Gary Wang, 2007. "Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 1(4), pages 391-413.
    63. Lin, Shih-Wei & Ying, Kuo-Ching & Lu, Chung-Cheng & Gupta, Jatinder N.D., 2011. "Applying multi-start simulated annealing to schedule a flowline manufacturing cell with sequence dependent family setup times," International Journal of Production Economics, Elsevier, vol. 130(2), pages 246-254, April.
    64. Gharbi, Anis & Ladhari, Talel & Msakni, Mohamed Kais & Serairi, Mehdi, 2013. "The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies," European Journal of Operational Research, Elsevier, vol. 231(1), pages 69-78.
    65. Vallada, Eva & Ruiz, Rubén, 2011. "A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 211(3), pages 612-622, June.
    66. Editors, 2014. "International Journal of Systems Science," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(12), pages 1-1, December.
    67. J Schaller & J M S Valente, 2013. "An evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardiness," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(6), pages 805-816, June.
    68. Lee, Cheng-Hsiung & Liao, Ching-Jong & Chung, Tsui-Ping, 2014. "Scheduling with multi-attribute setup times on two identical parallel machines," International Journal of Production Economics, Elsevier, vol. 153(C), pages 130-138.
    69. Zheng-liang Hou & Xiu-ping Guo, 2013. "Parallel Machine Scheduling with Resources Constraint and Sequence Dependent Setup Times," Springer Books, in: Runliang Dou (ed.), Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012), edition 127, chapter 0, pages 801-811, Springer.
    70. Guanlong Deng & Xingsheng Gu, 2014. "An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(3), pages 351-362.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Allahverdi, Ali & Aydilek, Harun, 2014. "Total completion time with makespan constraint in no-wait flowshops with setup times," European Journal of Operational Research, Elsevier, vol. 238(3), pages 724-734.
    2. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    3. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.
    4. Liou, Cheng-Dar & Hsieh, Yi-Chih, 2015. "A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times," International Journal of Production Economics, Elsevier, vol. 170(PA), pages 258-267.
    5. Arthur Kramer & Anand Subramanian, 2019. "A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems," Journal of Scheduling, Springer, vol. 22(1), pages 21-57, February.
    6. Dominik Kress & David Müller & Jenny Nossack, 2019. "A worker constrained flexible job shop scheduling problem with sequence-dependent setup times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 179-217, March.
    7. Shahvari, Omid & Logendran, Rasaratnam, 2016. "Hybrid flow shop batching and scheduling with a bi-criteria objective," International Journal of Production Economics, Elsevier, vol. 179(C), pages 239-258.
    8. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    9. Mohammad Reza Hosseinzadeh & Mehdi Heydari & Mohammad Mahdavi Mazdeh, 2022. "Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time," Operational Research, Springer, vol. 22(5), pages 5055-5105, November.
    10. Mansouri, S. Afshin & Aktas, Emel & Besikci, Umut, 2016. "Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption," European Journal of Operational Research, Elsevier, vol. 248(3), pages 772-788.
    11. Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y. & Nossack, Jenny & Pesch, Erwin, 2014. "Minimizing setup costs in a transfer line design problem with sequential operation processing," International Journal of Production Economics, Elsevier, vol. 151(C), pages 186-194.
    12. Susan Heath & Jonathan Bard & Douglas Morrice, 2013. "A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines," Annals of Operations Research, Springer, vol. 203(1), pages 295-323, March.
    13. Zhang, Zhe & Song, Xiaoling & Huang, Huijung & Zhou, Xiaoyang & Yin, Yong, 2022. "Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect," European Journal of Operational Research, Elsevier, vol. 297(3), pages 866-877.
    14. Anzanello, Michel J. & Fogliatto, Flavio S. & Santos, Luana, 2014. "Learning dependent job scheduling in mass customized scenarios considering ergonomic factors," International Journal of Production Economics, Elsevier, vol. 154(C), pages 136-145.
    15. Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
    16. Sheikh, Shaya & Komaki, G.M. & Kayvanfar, Vahid & Teymourian, Ehsan, 2019. "Multi-Stage assembly flow shop with setup time and release time," Operations Research Perspectives, Elsevier, vol. 6(C).
    17. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.
    18. Nekoiemehr, Nooshin & Selvarajah, Esaignani & Zhang, Guoqing, 2015. "Scheduling of jobs with cross families in two stage manufacturing systems," International Journal of Production Economics, Elsevier, vol. 167(C), pages 88-96.
    19. He, Xuan & Pan, Quan-Ke & Gao, Liang & Neufeld, Janis S., 2023. "An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 597-610.
    20. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:246:y:2015:i:2:p:345-378. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.