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

Minimizing maximum completion time in a proportionate flow shop with one machine of different speed

Author

Listed:
  • Choi, Byung-Cheon
  • Yoon, Suk-Hun
  • Chung, Sung-Jin

Abstract

No abstract is available for this item.

Suggested Citation

  • Choi, Byung-Cheon & Yoon, Suk-Hun & Chung, Sung-Jin, 2007. "Minimizing maximum completion time in a proportionate flow shop with one machine of different speed," European Journal of Operational Research, Elsevier, vol. 176(2), pages 964-974, January.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:2:p:964-974
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00832-5
    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. M. L. Smith & S. S. Panwalkar & R. A. Dudek, 1975. "Flowshop Sequencing Problem with Ordered Processing Time Matrices," Management Science, INFORMS, vol. 21(5), pages 544-549, January.
    2. D. P. Williamson & L. A. Hall & J. A. Hoogeveen & C. A. J. Hurkens & J. K. Lenstra & S. V. Sevast'janov & D. B. Shmoys, 1997. "Short Shop Schedules," Operations Research, INFORMS, vol. 45(2), pages 288-294, April.
    3. 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.
    4. Peng Si Ow, 1985. "Focused Scheduling in Proportionate Flowshops," Management Science, INFORMS, vol. 31(7), pages 852-869, July.
    5. Nicholas G. Hall & Marc E. Posner, 2001. "Generating Experimental Data for Computational Testing with Machine Scheduling Applications," Operations Research, INFORMS, vol. 49(6), pages 854-865, December.
    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. Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph Y.-T. & Pinedo, Michael L., 2010. "Flow shops with machine maintenance: Ordered and proportionate cases," European Journal of Operational Research, Elsevier, vol. 207(1), pages 97-104, November.
    2. Choi, Byung-Cheon & Chung, Jibok, 2011. "Two-machine flow shop scheduling problem with an outsourcing option," European Journal of Operational Research, Elsevier, vol. 213(1), pages 66-72, August.
    3. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    4. Rossit, Daniel A. & Vásquez, Óscar C. & Tohmé, Fernando & Frutos, Mariano & Safe, Martín D., 2021. "A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 289(3), pages 841-854.
    5. Koulamas, Christos & Kyparisis, George J., 2009. "A note on the proportionate flow shop with a bottleneck machine," European Journal of Operational Research, Elsevier, vol. 193(2), pages 644-645, March.
    6. Chung, Dae-Young & Choi, Byung-Cheon, 2013. "Outsourcing and scheduling for two-machine ordered flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 226(1), pages 46-52.
    7. Shabtay, Dvir, 2012. "The just-in-time scheduling problem in a flow-shop scheduling system," European Journal of Operational Research, Elsevier, vol. 216(3), pages 521-532.
    8. S.S. Panwalkar & Milton L. Smith & Christos Koulamas, 2013. "Review of the ordered and proportionate flow shop scheduling research," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 46-55, February.
    9. Byung-Cheon Choi & Joseph Y.-T. Leung & Michael L. Pinedo, 2011. "Minimizing makespan in an ordered flow shop with machine-dependent processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 797-818, November.

    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. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    2. Lee, Kangbok & Zheng, Feifeng & Pinedo, Michael L., 2019. "Online scheduling of ordered flow shops," European Journal of Operational Research, Elsevier, vol. 272(1), pages 50-60.
    3. Chung, Dae-Young & Choi, Byung-Cheon, 2013. "Outsourcing and scheduling for two-machine ordered flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 226(1), pages 46-52.
    4. Panwalkar, S.S. & Koulamas, Christos, 2012. "An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines," European Journal of Operational Research, Elsevier, vol. 221(1), pages 7-13.
    5. S.S. Panwalkar & Milton L. Smith & Christos Koulamas, 2013. "Review of the ordered and proportionate flow shop scheduling research," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 46-55, February.
    6. Byung-Cheon Choi & Joseph Y.-T. Leung & Michael L. Pinedo, 2011. "Minimizing makespan in an ordered flow shop with machine-dependent processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 797-818, November.
    7. Yu, Tae-Sun & Pinedo, Michael, 2020. "Flow shops with reentry: Reversibility properties and makespan optimal schedules," European Journal of Operational Research, Elsevier, vol. 282(2), pages 478-490.
    8. Koulamas, Christos & Kyparisis, George J., 2007. "Single-machine and two-machine flowshop scheduling with general learning functions," European Journal of Operational Research, Elsevier, vol. 178(2), pages 402-407, April.
    9. Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph Y.-T. & Pinedo, Michael L., 2010. "Flow shops with machine maintenance: Ordered and proportionate cases," European Journal of Operational Research, Elsevier, vol. 207(1), pages 97-104, November.
    10. Choi, Byung-Cheon & Chung, Jibok, 2011. "Two-machine flow shop scheduling problem with an outsourcing option," European Journal of Operational Research, Elsevier, vol. 213(1), pages 66-72, August.
    11. Matta, Marie E. & Elmaghraby, Salah E., 2010. "Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop," European Journal of Operational Research, Elsevier, vol. 201(3), pages 720-728, March.
    12. 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.
    13. Inna G. Drobouchevitch, 2021. "Three-machine open shop with a bottleneck machine revisited," Journal of Scheduling, Springer, vol. 24(2), pages 197-208, April.
    14. Antonina P. Khramova & Ilya Chernykh, 2021. "A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing," Journal of Scheduling, Springer, vol. 24(4), pages 405-412, August.
    15. Zhi-Long Chen & Nicholas G. Hall, 2010. "The Coordination of Pricing and Scheduling Decisions," Manufacturing & Service Operations Management, INFORMS, vol. 12(1), pages 77-92, April.
    16. Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang, 2021. "Robust Capacity Planning for Project Management," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1533-1550, October.
    17. Liu, Jiyin & Reeves, Colin R, 2001. "Constructive and composite heuristic solutions to the P//[summation operator]Ci scheduling problem," European Journal of Operational Research, Elsevier, vol. 132(2), pages 439-452, July.
    18. Adenso-Diaz, Belarmino, 1996. "An SA/TS mixture algorithm for the scheduling tardiness problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 516-524, February.
    19. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 0. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    20. Drobouchevitch, Inna G. & Strusevich, Vitaly A., 2001. "Two-stage open shop scheduling with a bottleneck machine," European Journal of Operational Research, Elsevier, vol. 128(1), pages 159-174, January.

    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:176:y:2007:i:2:p:964-974. 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.