IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v20y2020i1d10.1007_s12351-017-0308-7.html
   My bibliography  Save this article

A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates

Author

Listed:
  • Mohamed Ali Rakrouki

    (Taibah University
    Université de Tunis)

  • Anis Kooli

    (Université de Tunis)

  • Sabrine Chalghoumi

    (Université de Tunis)

  • Talel Ladhari

    (Université de Tunis
    Umm Al-Qura University
    Université de Tunis)

Abstract

We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop problem subject to release dates. We derive several lower bounds as well as a branch-and-bound algorithm for the problem under consideration. Computational experiments, on a large set of randomly generated instances, provide evidence that the proposed procedure performs consistently well.

Suggested Citation

  • Mohamed Ali Rakrouki & Anis Kooli & Sabrine Chalghoumi & Talel Ladhari, 2020. "A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates," Operational Research, Springer, vol. 20(1), pages 21-35, March.
    • Handle: RePEc:spr:operea:v:20:y:2020:i:1:d:10.1007_s12351-017-0308-7
    DOI: 10.1007/s12351-017-0308-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-017-0308-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-017-0308-7?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. Della Croce, F. & Narayan, V. & Tadei, R., 1996. "The two-machine total completion time flow shop problem," European Journal of Operational Research, Elsevier, vol. 90(2), pages 227-237, April.
    2. Chris N. Potts & Luk N. Van Wassenhove, 1985. "A Branch and Bound Algorithm for the Total Weighted Tardiness Problem," Operations Research, INFORMS, vol. 33(2), pages 363-377, April.
    3. Edward Ignall & Linus Schrage, 1965. "Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems," Operations Research, INFORMS, vol. 13(3), pages 400-412, June.
    4. Ladhari, Talel & Rakrouki, Mohamed Ali, 2009. "Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop," International Journal of Production Economics, Elsevier, vol. 122(2), pages 678-691, December.
    5. Chung, Chia-Shin & Flynn, James & Kirca, Omer, 2002. "A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems," International Journal of Production Economics, Elsevier, vol. 79(3), pages 185-196, October.
    6. Akkan, Can & Karabati, Selcuk, 2004. "The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm," European Journal of Operational Research, Elsevier, vol. 159(2), pages 420-429, December.
    7. Della Croce, F. & Ghirardi, M. & Tadei, R., 2002. "An improved branch-and-bound algorithm for the two machine total completion time flow shop problem," European Journal of Operational Research, Elsevier, vol. 139(2), pages 293-301, June.
    8. 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. Vahid Nasrollahi & Ghasem Moslehi & Mohammad Reisi-Nafchi, 2022. "Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem," Operational Research, Springer, vol. 22(2), pages 1403-1442, April.

    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. Ladhari, Talel & Rakrouki, Mohamed Ali, 2009. "Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop," International Journal of Production Economics, Elsevier, vol. 122(2), pages 678-691, December.
    2. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    3. Detienne, Boris & Sadykov, Ruslan & Tanaka, Shunji, 2016. "The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation," European Journal of Operational Research, Elsevier, vol. 252(3), pages 750-760.
    4. Federico Della Croce & Andrea Grosso & Fabio Salassa, 2014. "A matheuristic approach for the two-machine total completion time flow shop problem," Annals of Operations Research, Springer, vol. 213(1), pages 67-78, February.
    5. S Yanai & T Fujie, 2006. "A three-machine permutation flow-shop problem with minimum makespan on the second machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(4), pages 460-468, April.
    6. 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.
    7. Lin, B.M.T. & Lu, C.Y. & Shyu, S.J. & Tsai, C.Y., 2008. "Development of new features of ant colony optimization for flowshop scheduling," International Journal of Production Economics, Elsevier, vol. 112(2), pages 742-755, April.
    8. N Madhushini & C Rajendran & Y Deepa, 2009. "Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted f," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 991-1004, July.
    9. Yen-Shing Tsai & Bertrand M. T. Lin, 2016. "Flow shop non-idle scheduling and resource-constrained scheduling," Annals of Operations Research, Springer, vol. 238(1), pages 577-585, March.
    10. Lee, Wen-Chiung & Wu, Chin-Chia, 2004. "Minimizing total completion time in a two-machine flowshop with a learning effect," International Journal of Production Economics, Elsevier, vol. 88(1), pages 85-93, March.
    11. Yen-Shing Tsai & Bertrand Lin, 2016. "Flow shop non-idle scheduling and resource-constrained scheduling," Annals of Operations Research, Springer, vol. 238(1), pages 577-585, March.
    12. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    13. B-J Joo & Y-D Kim, 2009. "A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 572-582, April.
    14. Baptiste, Pierre, 2006. "Stochastic algorithms: Using the worst to reach the best," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 41-51, February.
    15. Anna Ławrynowicz, 2006. "Hybrid approach with an expert system and a genetic algorithm to production management in the supply net," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 14(1‐2), pages 59-76, January.
    16. A Ławrynowicz, 2008. "Integration of production planning and scheduling using an expert system and a genetic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(4), pages 455-463, April.
    17. Ishibuchi, Hisao & Misaki, Shinta & Tanaka, Hideo, 1995. "Modified simulated annealing algorithms for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 81(2), pages 388-398, March.
    18. 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.
    19. Della Croce, F. & Ghirardi, M. & Tadei, R., 2002. "An improved branch-and-bound algorithm for the two machine total completion time flow shop problem," European Journal of Operational Research, Elsevier, vol. 139(2), pages 293-301, June.
    20. Gajpal, Yuvraj & Rajendran, Chandrasekharan, 2006. "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops," International Journal of Production Economics, Elsevier, vol. 101(2), pages 259-272, June.

    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:spr:operea:v:20:y:2020:i:1:d:10.1007_s12351-017-0308-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.