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

A note on scheduling flowshops with flexible stage ordering

Author

Listed:
  • Koulamas, Christos
  • Kyparisis, George J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Koulamas, Christos & Kyparisis, George J., 2001. "A note on scheduling flowshops with flexible stage ordering," European Journal of Operational Research, Elsevier, vol. 129(1), pages 224-229, February.
    • Handle: RePEc:eee:ejores:v:129:y:2001:i:1:p:224-229
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00430-0
    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. Ramalhinho Lourenco, Helena, 1996. "Sevast'yanov's algorithm for the flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 176-189, May.
    2. Teofilo Gonzalez & Sartaj Sahni, 1978. "Flowshop and Jobshop Schedules: Complexity and Approximation," Operations Research, INFORMS, vol. 26(1), pages 36-52, February.
    3. Hau L. Lee & Christopher S. Tang, 1998. "Variability Reduction Through Operations Reversal," Management Science, INFORMS, vol. 44(2), pages 162-172, February.
    4. Koulamas, Christos, 1998. "A new constructive heuristic for the flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 105(1), pages 66-71, February.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. Nikhil Jain & Anand Paul, 2001. "A Generalized Model of Operations Reversal for Fashion Goods," Management Science, INFORMS, vol. 47(4), pages 595-600, April.
    5. Işık Biçer & Florian Lücker & Tamer Boyacı, 2022. "Beyond Retail Stores: Managing Product Proliferation along the Supply Chain," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1135-1156, March.
    6. Fay, Scott & Mitra, Deb & Wang, Qiong, 2009. "Ask or infer? Strategic implications of alternative learning approaches in customization," International Journal of Research in Marketing, Elsevier, vol. 26(2), pages 136-152.
    7. Wu, Chin-Chia & Lee, Wen-Chiung, 2006. "Two-machine flowshop scheduling to minimize mean flow time under linear deterioration," International Journal of Production Economics, Elsevier, vol. 103(2), pages 572-584, October.
    8. 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.
    9. T.C.E. Cheng & B.M.T. Lin & A. Toker, 2000. "Makespan minimization in the two‐machine flowshop batch scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 128-144, March.
    10. 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.
    11. Monaci, Marta & Agasucci, Valerio & Grani, Giorgio, 2024. "An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents," European Journal of Operational Research, Elsevier, vol. 312(3), pages 910-926.
    12. Alfaro, José A. & Corbett, Charles J., 2000. "The value of SKU rationalization: the pooling effect under suboptimal inventory policies," DEE - Working Papers. Business Economics. WB 9917, Universidad Carlos III de Madrid. Departamento de Economía de la Empresa.
    13. Ngniatedema, Thomas & Fono, Louis Aimé & Mbondo, Georges Dieudonné, 2015. "A delayed product customization cost model with supplier delivery performance," European Journal of Operational Research, Elsevier, vol. 243(1), pages 109-119.
    14. Ji-Bo Wang & Ming-Zheng Wang, 2011. "Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 191(1), pages 155-169, November.
    15. Li, Gang & Wang, Xiao-Yuan & Wang, Ji-Bo & Sun, Lin-Yan, 2013. "Worst case analysis of flow shop scheduling problems with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 142(1), pages 98-104.
    16. Oguz, C. & Fikret Ercan, M. & Edwin Cheng, T. C. & Fung, Y. F., 2003. "Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop," European Journal of Operational Research, Elsevier, vol. 149(2), pages 390-403, September.
    17. Lamothe, Jacques & Hadj-Hamou, Khaled & Aldanondo, Michel, 2006. "An optimization model for selecting a product family and designing its supply chain," European Journal of Operational Research, Elsevier, vol. 169(3), pages 1030-1047, March.
    18. Nan Yang & Renyu Zhang, 2022. "Comparative Statics Analysis of An Inventory Management Model with Dynamic Pricing, Market Environment Fluctuation, and Delayed Differentiation," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 341-357, January.
    19. Tamssaouet, Karim & Dauzère-Pérès, Stéphane, 2023. "A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 311(2), pages 455-471.
    20. Milind G. Sohoni & Achal Bassamboo & Sunil Chopra & Usha Mohan & Nuri Sendil, 2010. "Threshold incentives over multiple periods and the sales hockey stick phenomenon," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(6), pages 503-518, September.

    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:129:y:2001:i:1:p:224-229. 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.