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

The permutation flow shop with buffers: A tabu search approach

Author

Listed:
  • Nowicki, Eugeniusz

Abstract

No abstract is available for this item.

Suggested Citation

  • Nowicki, Eugeniusz, 1999. "The permutation flow shop with buffers: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 116(1), pages 205-219, July.
    • Handle: RePEc:eee:ejores:v:116:y:1999:i:1:p:205-219
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00017-4
    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. Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January.
    2. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    3. Eugeniusz Nowicki & Czeslaw Smutnicki, 1996. "A Fast Taboo Search Algorithm for the Job Shop Problem," Management Science, INFORMS, vol. 42(6), pages 797-813, June.
    4. 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.
    5. Nicholas G. Hall & Chelliah Sriskandarajah, 1996. "A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process," Operations Research, INFORMS, vol. 44(3), pages 510-525, June.
    6. 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. Wardono, Bagas & Fathi, Yahya, 2004. "A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities," European Journal of Operational Research, Elsevier, vol. 155(2), pages 380-401, June.
    2. Mascis, Alessandro & Pacciarelli, Dario, 2002. "Job-shop scheduling with blocking and no-wait constraints," European Journal of Operational Research, Elsevier, vol. 143(3), pages 498-517, December.
    3. Sheu Chen, 2010. "A Heuristic Algorithm for Hierarchical Hub-and-spoke Network of Time-definite Common Carrier Operation Planning Problem," Networks and Spatial Economics, Springer, vol. 10(4), pages 509-523, December.
    4. Bo Liu & Ling Wang & Ying Liu & Shouyang Wang, 2011. "A unified framework for population-based metaheuristics," Annals of Operations Research, Springer, vol. 186(1), pages 231-262, June.
    5. Débora Ronconi, 2005. "A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking," Annals of Operations Research, Springer, vol. 138(1), pages 53-65, September.
    6. Burdett, R.L. & Kozan, E., 2010. "A disjunctive graph model and framework for constructing new train schedules," European Journal of Operational Research, Elsevier, vol. 200(1), pages 85-98, January.
    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. Ronconi, Debora P., 2004. "A note on constructive heuristics for the flowshop problem with blocking," International Journal of Production Economics, Elsevier, vol. 87(1), pages 39-48, January.
    9. Libralesso, Luc & Focke, Pablo Andres & Secardin, Aurélien & Jost, Vincent, 2022. "Iterative beam search algorithms for the permutation flowshop," European Journal of Operational Research, Elsevier, vol. 301(1), pages 217-234.
    10. Smutnicki, Czeslaw & Pempera, Jaroslaw & Bocewicz, Grzegorz & Banaszak, Zbigniew, 2022. "Cyclic flow-shop scheduling with no-wait constraints and missing operations," European Journal of Operational Research, Elsevier, vol. 302(1), pages 39-49.
    11. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    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. Martinez, S. & Dauzere-Peres, S. & Gueret, C. & Mati, Y. & Sauer, N., 2006. "Complexity of flowshop scheduling problems with a new blocking constraint," European Journal of Operational Research, Elsevier, vol. 169(3), pages 855-864, March.
    14. Briskorn, Dirk & Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph & Pinedo, Michael, 2010. "Complexity of single machine scheduling subject to nonnegative inventory constraints," European Journal of Operational Research, Elsevier, vol. 207(2), pages 605-619, December.
    15. Thornton, Henry W. & Hunsucker, John L., 2004. "A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage," European Journal of Operational Research, Elsevier, vol. 152(1), pages 96-114, January.
    16. Neumann, Klaus & Schwindt, Christoph & Trautmann, Norbert, 2005. "Scheduling of continuous and discontinuous material flows with intermediate storage restrictions," European Journal of Operational Research, Elsevier, vol. 165(2), pages 495-509, September.
    17. 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.
    18. S. S. Panwalkar & Christos Koulamas, 2019. "The evolution of schematic representations of flow shop scheduling problems," Journal of Scheduling, Springer, vol. 22(4), pages 379-391, August.
    19. 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.

    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. Smutnicki, Czeslaw & Pempera, Jaroslaw & Bocewicz, Grzegorz & Banaszak, Zbigniew, 2022. "Cyclic flow-shop scheduling with no-wait constraints and missing operations," European Journal of Operational Research, Elsevier, vol. 302(1), pages 39-49.
    2. Grabowski, Jøzef & Pempera, Jaroslaw, 2007. "The permutation flow shop problem with blocking. A tabu search approach," Omega, Elsevier, vol. 35(3), pages 302-311, June.
    3. Liu, Shi Qiang & Kozan, Erhan, 2009. "Scheduling a flow shop with combined buffer conditions," International Journal of Production Economics, Elsevier, vol. 117(2), pages 371-380, February.
    4. Jean-Paul Watson & Laura Barbulescu & L. Darrell Whitley & Adele E. Howe, 2002. "Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 98-123, May.
    5. 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.
    6. Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.
    7. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    8. Lin, Shih-Wei & Ying, Kuo-Ching, 2016. "Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics," Omega, Elsevier, vol. 64(C), pages 115-125.
    9. Joaquín Bautista-Valhondo & Rocío Alfaro-Pozo, 2020. "Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 5-23, March.
    10. Matthias Bultmann & Sigrid Knust & Stefan Waldherr, 2018. "Flow shop scheduling with flexible processing times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 809-829, July.
    11. Christoph Schuster, 2006. "No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 473-491, July.
    12. 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.
    13. 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.
    14. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    15. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.
    16. Pan, Quan-Ke & Ruiz, Rubén, 2014. "An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem," Omega, Elsevier, vol. 44(C), pages 41-50.
    17. 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.
    18. 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.
    19. Pan, Quan-Ke & Wang, Ling, 2012. "Effective heuristics for the blocking flowshop scheduling problem with makespan minimization," Omega, Elsevier, vol. 40(2), pages 218-229, April.
    20. Benavides, Alexander J. & Ritt, Marcus & Miralles, Cristóbal, 2014. "Flow shop scheduling with heterogeneous workers," European Journal of Operational Research, Elsevier, vol. 237(2), pages 713-720.

    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:116:y:1999:i:1:p:205-219. 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.