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

Scheduling flexible flow lines with sequence-dependent setup times

Author

Listed:
  • Kurz, Mary E.
  • Askin, Ronald G.

Abstract

No abstract is available for this item.

Suggested Citation

  • Kurz, Mary E. & Askin, Ronald G., 2004. "Scheduling flexible flow lines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 159(1), pages 66-82, November.
    • Handle: RePEc:eee:ejores:v:159:y:2004:i:1:p:66-82
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00401-6
    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. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.
    2. Robert J. Wittrock, 1988. "An Adaptable Scheduling Algorithm for Flexible Flow Lines," Operations Research, INFORMS, vol. 36(3), pages 445-453, June.
    3. 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.
    4. Brah, Shaukat A. & Hunsucker, John L., 1991. "Branch and bound algorithm for the flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 51(1), pages 88-99, March.
    5. Rajendran, Chandrasekharan & Chaudhuri, Dipak, 1992. "Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan," International Journal of Production Economics, Elsevier, vol. 27(2), pages 137-143, May.
    6. Kurz, Mary E. & Askin, Ronald G., 2003. "Comparing scheduling rules for flexible flow lines," International Journal of Production Economics, Elsevier, vol. 85(3), pages 371-388, September.
    7. Riane, Fouad & Artiba, Abdelhakim & E. Elmaghraby, Salah, 1998. "A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 109(2), pages 321-329, September.
    8. Agnetis, A. & Pacifici, A. & Rossi, F. & Lucertini, M. & Nicoletti, S. & Nicolo, F. & Oriolo, G. & Pacciarelli, D. & Pesaro, E., 1997. "Scheduling of flexible flow lines in an automobile assembly plant," European Journal of Operational Research, Elsevier, vol. 97(2), pages 348-362, March.
    9. 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.
    10. Nowicki, Eugeniusz, 1994. "An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times," European Journal of Operational Research, Elsevier, vol. 72(1), pages 74-81, January.
    11. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1998. "The flow shop with parallel machines: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 226-253, April.
    12. Robert H. Storer & S. David Wu & Renzo Vaccari, 1992. "New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling," Management Science, INFORMS, vol. 38(10), pages 1495-1509, October.
    13. James C. Bean, 1994. "Genetic Algorithms and Random Keys for Sequencing and Optimization," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 154-160, May.
    14. Sriskandarajah, C. & Sethi, S. P., 1989. "Scheduling algorithms for flexible flowshops: Worst and average case performance," European Journal of Operational Research, Elsevier, vol. 43(2), pages 143-160, November.
    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. Mingxing Li & Ray Y. Zhong & Ting Qu & George Q. Huang, 2022. "Spatial–temporal out-of-order execution for advanced planning and scheduling in cyber-physical factories," Journal of Intelligent Manufacturing, Springer, vol. 33(5), pages 1355-1372, June.
    2. K A H Kobbacy & S Vadera & M H Rasmy, 2007. "AI and OR in management of operations: history and trends," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 10-28, January.
    3. Gheisariha, Elmira & Tavana, Madjid & Jolai, Fariborz & Rabiee, Meysam, 2021. "A simulation–optimization model for solving flexible flow shop scheduling problems with rework and transportation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 180(C), pages 152-178.
    4. 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.
    5. Zhen Song & Håkan Schunnesson & Mikael Rinne & John Sturgul, 2015. "Intelligent Scheduling for Underground Mobile Mining Equipment," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-21, June.
    6. Luo, Hao & Du, Bing & Huang, George Q. & Chen, Huaping & Li, Xiaolin, 2013. "Hybrid flow shop scheduling considering machine electricity consumption cost," International Journal of Production Economics, Elsevier, vol. 146(2), pages 423-439.
    7. 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.
    8. Amin-Naseri, Mohammad Reza & Beheshti-Nia, Mohammad Ali, 2009. "Hybrid flow shop scheduling with parallel batching," International Journal of Production Economics, Elsevier, vol. 117(1), pages 185-196, January.
    9. Pan, Quan-Ke & Wang, Ling & Li, Jun-Qing & Duan, Jun-Hua, 2014. "A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation," Omega, Elsevier, vol. 45(C), pages 42-56.
    10. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    11. Quadt, Daniel & Kuhn, Heinrich, 2007. "Batch scheduling of jobs with identical process times on flexible flow lines," International Journal of Production Economics, Elsevier, vol. 105(2), pages 385-401, February.
    12. Weng, Wei & Fujimura, Shigeru, 2012. "Control methods for dynamic time-based manufacturing under customized product lead times," European Journal of Operational Research, Elsevier, vol. 218(1), pages 86-96.
    13. Urlings, Thijs & Ruiz, Rubén & Stützle, Thomas, 2010. "Shifting representation search for hybrid flexible flowline problems," European Journal of Operational Research, Elsevier, vol. 207(2), pages 1086-1095, December.
    14. Miguel A. Ortíz & Leidy E. Betancourt & Kevin Parra Negrete & Fabio Felice & Antonella Petrillo, 2018. "Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry," Annals of Operations Research, Springer, vol. 264(1), pages 409-433, May.
    15. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    16. Baumann, Philipp & Trautmann, Norbert, 2014. "A hybrid method for large-scale short-term scheduling of make-and-pack production processes," European Journal of Operational Research, Elsevier, vol. 236(2), pages 718-735.
    17. Frank Benda & Roland Braune & Karl F. Doerner & Richard F. Hartl, 2019. "A machine learning approach for flow shop scheduling problems with alternative resources, sequence-dependent setup times, and blocking," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 871-893, December.
    18. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    19. Mostafa Zandieh & Seyed Mojtaba Sajadi & Reza Behnoud, 2017. "Integrated production scheduling and maintenance planning in a hybrid flow shop system: a multi-objective approach," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 1630-1642, November.
    20. Trevino-Martinez, Samuel & Sawhney, Rapinder & Shylo, Oleg, 2022. "Energy-carbon footprint optimization in sequence-dependent production scheduling," Applied Energy, Elsevier, vol. 315(C).

    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. Kurz, Mary E. & Askin, Ronald G., 2003. "Comparing scheduling rules for flexible flow lines," International Journal of Production Economics, Elsevier, vol. 85(3), pages 371-388, September.
    2. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    3. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    4. Ruiz, Ruben & Maroto, Concepcion, 2006. "A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility," European Journal of Operational Research, Elsevier, vol. 169(3), pages 781-800, March.
    5. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.
    6. Quadt, Daniel & Kuhn, Heinrich, 2007. "Batch scheduling of jobs with identical process times on flexible flow lines," International Journal of Production Economics, Elsevier, vol. 105(2), pages 385-401, February.
    7. Chen, Lu & Bostel, Nathalie & Dejax, Pierre & Cai, Jianguo & Xi, Lifeng, 2007. "A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal," European Journal of Operational Research, Elsevier, vol. 181(1), pages 40-58, August.
    8. Jin, Zhihong & Yang, Zan & Ito, Takahiro, 2006. "Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 100(2), pages 322-334, April.
    9. Lin, Hung-Tso & Liao, Ching-Jong, 2003. "A case study in a two-stage hybrid flow shop with setup time and dedicated machines," International Journal of Production Economics, Elsevier, vol. 86(2), pages 133-143, November.
    10. Logendran, Rasaratnam & Carson, Sara & Hanson, Erik, 2005. "Group scheduling in flexible flow shops," International Journal of Production Economics, Elsevier, vol. 96(2), pages 143-155, May.
    11. Luo, Hao & Du, Bing & Huang, George Q. & Chen, Huaping & Li, Xiaolin, 2013. "Hybrid flow shop scheduling considering machine electricity consumption cost," International Journal of Production Economics, Elsevier, vol. 146(2), pages 423-439.
    12. 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.
    13. Fernandez-Viagas, Victor & Molina-Pariente, Jose M. & Framinan, Jose M., 2020. "Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 282(3), pages 858-872.
    14. Mohamed Haouari & Lotfi Hidri & Anis Gharbi, 2006. "Optimal Scheduling of a Two-stage Hybrid Flow Shop," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 107-124, August.
    15. Suresh, V., 1997. "A note on scheduling of two-stage flow shop with multiple processors," International Journal of Production Economics, Elsevier, vol. 49(1), pages 77-82, March.
    16. Pan, Quan-Ke & Wang, Ling & Li, Jun-Qing & Duan, Jun-Hua, 2014. "A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation," Omega, Elsevier, vol. 45(C), pages 42-56.
    17. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1998. "The flow shop with parallel machines: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 226-253, April.
    18. 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.
    19. Ali Hosseinabadi & Hajar Siar & Shahaboddin Shamshirband & Mohammad Shojafar & Mohd Nasir, 2015. "Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in Small and Medium Enterprises," Annals of Operations Research, Springer, vol. 229(1), pages 451-474, June.
    20. Néron, Emmanuel & Baptiste, Philippe & Gupta, Jatinder N. D., 2001. "Solving hybrid flow shop problem using energetic reasoning and global operations," Omega, Elsevier, vol. 29(6), pages 501-511, December.

    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:159:y:2004:i:1:p:66-82. 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.