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

Scheduling a flowline manufacturing cell with sequence dependent family setup times

Author

Listed:
  • Schaller, Jeffrey E.
  • Gupta, Jatinder N. D.
  • Vakharia, Asoo J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Schaller, Jeffrey E. & Gupta, Jatinder N. D. & Vakharia, Asoo J., 2000. "Scheduling a flowline manufacturing cell with sequence dependent family setup times," European Journal of Operational Research, Elsevier, vol. 125(2), pages 324-339, September.
    • Handle: RePEc:eee:ejores:v:125:y:2000:i:2:p:324-339
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00387-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. David G. Dannenbring, 1977. "An Evaluation of Flow Shop Sequencing Heuristics," Management Science, INFORMS, vol. 23(11), pages 1174-1182, July.
    2. Herbert G. Campbell & Richard A. Dudek & Milton L. Smith, 1970. "A Heuristic Algorithm for the n Job, m Machine Sequencing Problem," Management Science, INFORMS, vol. 16(10), pages 630-637, June.
    3. J. William Gavett, 1965. "Three Heuristic Rules for Sequencing Jobs to a Single Production Facility," Management Science, INFORMS, vol. 11(8), pages 166-176, June.
    4. Gupta, Jatinder N. D. & Darrow, William P., 1986. "The two-machine sequence dependent flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 24(3), pages 439-446, March.
    5. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    2. 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.
    3. 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.
    4. 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.
    5. Logendran, Rasaratnam & deSzoeke, Paula & Barnard, Faith, 2006. "Sequence-dependent group scheduling problems in flexible flow shops," International Journal of Production Economics, Elsevier, vol. 102(1), pages 66-86, July.
    6. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    7. Allahverdi, Ali & Al-Anzi, Fawaz S., 2006. "A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times," European Journal of Operational Research, Elsevier, vol. 169(3), pages 767-780, March.
    8. Wang, Yuhang & Han, Yuyan & Wang, Yuting & Tasgetiren, M. Fatih & Li, Junqing & Gao, Kaizhou, 2023. "Intelligent optimization under the makespan constraint: Rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem," European Journal of Operational Research, Elsevier, vol. 311(3), pages 816-832.
    9. Choudhury, Nilanjan D. & Wilhelm, Wilbert E. & Rao, Brijesh & Gott, Jonathan & Khotekar, Nikhilesh, 2007. "Process planning for circuit card assembly on a series of dual head placement machines," European Journal of Operational Research, Elsevier, vol. 182(2), pages 626-639, October.
    10. 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.
    11. Ghorbanzadeh, Masoumeh & Ranjbar, Mohammad, 2023. "Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints," European Journal of Operational Research, Elsevier, vol. 307(2), pages 519-537.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. Feng, Hanxin & Xi, Lifeng & Xiao, Lei & Xia, Tangbin & Pan, Ershun, 2018. "Imperfect preventive maintenance optimization for flexible flowshop manufacturing cells considering sequence-dependent group scheduling," Reliability Engineering and System Safety, Elsevier, vol. 176(C), pages 218-229.

    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. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.
    2. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    3. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    4. Ben-Daya, M. & Al-Fawzan, M., 1998. "A tabu search approach for the flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 109(1), pages 88-95, August.
    5. Ruiz, Ruben & Stutzle, Thomas, 2007. "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March.
    6. M Haouari & T Ladhari, 2003. "A branch-and-bound-based local search method for the flow shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1076-1084, October.
    7. Kalczynski, Pawel J. & Kamburowski, Jerzy, 2009. "An empirical analysis of the optimality rate of flow shop heuristics," European Journal of Operational Research, Elsevier, vol. 198(1), pages 93-101, October.
    8. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1996. "A fast tabu search algorithm for the permutation flow-shop problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 160-175, May.
    9. Botta-Genoulaz, Valerie, 2000. "Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 101-111, March.
    10. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
    11. F T Tseng & J N D Gupta & E F Stafford, 2006. "A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 541-551, May.
    12. Fernandez-Viagas, Victor & Talens, Carla & Framinan, Jose M., 2022. "Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation," European Journal of Operational Research, Elsevier, vol. 299(3), pages 869-882.
    13. Logendran, Rasaratnam & Mai, Luen & Talkington, Diane, 1995. "Combined heuristics for bi-level group scheduling problems," International Journal of Production Economics, Elsevier, vol. 38(2-3), pages 133-145, March.
    14. Tasgetiren, M. Fatih & Liang, Yun-Chia & Sevkli, Mehmet & Gencyilmaz, Gunes, 2007. "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1930-1947, March.
    15. Nearchou, A.C.Andreas C., 2004. "The effect of various operators on the genetic search for large scheduling problems," International Journal of Production Economics, Elsevier, vol. 88(2), pages 191-203, March.
    16. JC-H Pan & J-S Chen, 2003. "Minimizing makespan in re-entrant permutation flow-shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 642-653, June.
    17. Sharadapriyadarshini, B. & Rajendran, Chandrasekharan, 1997. "Heuristics for scheduling in a Kanban system with dual blocking mechanisms," European Journal of Operational Research, Elsevier, vol. 103(3), pages 439-452, December.
    18. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    19. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On the NEH heuristic for minimizing the makespan in permutation flow shops," Omega, Elsevier, vol. 35(1), pages 53-60, February.
    20. Smutnicki, Czeslaw, 1998. "Some results of the worst-case analysis for flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 109(1), pages 66-87, August.

    More about this item

    Statistics

    Access and download statistics

    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:125:y:2000:i:2:p:324-339. 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.