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

Flowshop scheduling with identical jobs and uniform parallel machines

Author

Listed:
  • Dessouky, Maged M.
  • Dessouky, Mohamed I.
  • Verma, Sushil K.

Abstract

No abstract is available for this item.

Suggested Citation

  • Dessouky, Maged M. & Dessouky, Mohamed I. & Verma, Sushil K., 1998. "Flowshop scheduling with identical jobs and uniform parallel machines," European Journal of Operational Research, Elsevier, vol. 109(3), pages 620-631, September.
    • Handle: RePEc:eee:ejores:v:109:y:1998:i:3:p:620-631
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00194-X
    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.I. Dessouky & B.J. Lageweg & J.K. Lenstra & S.L. van de Velde, 1990. "Scheduling identical jobs on uniform parallel machines," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 44(3), pages 115-123, September.
    2. Graham McMahon & Michael Florian, 1975. "On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness," Operations Research, INFORMS, vol. 23(3), pages 475-482, June.
    3. Cheng, T. C. E. & Sin, C. C. S., 1990. "A state-of-the-art review of parallel-machine scheduling research," European Journal of Operational Research, Elsevier, vol. 47(3), pages 271-292, August.
    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. Chen, Jeng-Fung & Wu, Tai-Hsi, 2006. "Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints," Omega, Elsevier, vol. 34(1), pages 81-89, January.
    2. F Sivrikaya şerifoğlu & G Ulusoy, 2004. "Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(5), pages 504-512, May.
    3. W L Pearn & S H Chung & M H Yang & Y H Chen, 2004. "Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(11), pages 1194-1207, November.
    4. 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.
    5. Koulamas, Christos & Kyparisis, George J., 2004. "Makespan minimization on uniform parallel machines with release times," European Journal of Operational Research, Elsevier, vol. 157(1), pages 262-266, August.
    6. Mok, P.Y. & Kwong, C.K. & Wong, W.K., 2007. "Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1876-1893, March.
    7. J. Behnamian & S. M. T. Fatemi Ghomi, 2016. "A survey of multi-factory scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(1), pages 231-249, February.
    8. Jun-Ho Lee & Hoon Jang, 2019. "Uniform Parallel Machine Scheduling with Dedicated Machines, Job Splitting and Setup Resources," Sustainability, MDPI, vol. 11(24), pages 1-23, December.
    9. Carlos Paternina-Arboleda & Jairo Montoya-Torres & Milton Acero-Dominguez & Maria Herrera-Hernandez, 2008. "Scheduling jobs on a k-stage flexible flow-shop," Annals of Operations Research, Springer, vol. 164(1), pages 29-40, November.
    10. Bertel, S. & Billaut, J. -C., 2004. "A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation," European Journal of Operational Research, Elsevier, vol. 159(3), pages 651-662, December.
    11. 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.

    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. Jun-Ho Lee & Hoon Jang, 2019. "Uniform Parallel Machine Scheduling with Dedicated Machines, Job Splitting and Setup Resources," Sustainability, MDPI, vol. 11(24), pages 1-23, December.
    2. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    3. Nodari Vakhania & Frank Werner, 2021. "Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines," Mathematics, MDPI, vol. 9(6), pages 1-18, March.
    4. Yalaoui, F. & Chu, C., 2006. "New exact method to solve the Pm/rj/[summation operator]Cj schedule problem," International Journal of Production Economics, Elsevier, vol. 100(1), pages 168-179, March.
    5. 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.
    6. Biber Nurit & Mor Baruch & Schlissel Yitzhak & Shapira Dana, 2023. "Lot scheduling involving completion time problems on identical parallel machines," Operational Research, Springer, vol. 23(1), pages 1-29, March.
    7. George L. Vairaktarakis, 2003. "The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem," Management Science, INFORMS, vol. 49(6), pages 718-732, June.
    8. Anurag Agarwal & Varghese S. Jacob & Hasan Pirkul, 2006. "An Improved Augmented Neural-Network Approach for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 119-128, February.
    9. Kloster, Konstantin & Moeini, Mahdi & Vigo, Daniele & Wendt, Oliver, 2023. "The multiple traveling salesman problem in presence of drone- and robot-supported packet stations," European Journal of Operational Research, Elsevier, vol. 305(2), pages 630-643.
    10. Lee, Soonhui & Turner, Jonathan & Daskin, Mark S. & Homem-de-Mello, Tito & Smilowitz, Karen, 2012. "Improving fleet utilization for carriers by interval scheduling," European Journal of Operational Research, Elsevier, vol. 218(1), pages 261-269.
    11. Reha Uzsoy & Chung‐Yee Lee & Louis A. Martin‐Vega, 1992. "Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 369-388, April.
    12. Henrich, Peter & Land, Martin & Gaalman, Gerard, 2006. "Grouping machines for effective workload control," International Journal of Production Economics, Elsevier, vol. 104(1), pages 125-142, November.
    13. Jun-Ho Lee & Hyun-Jung Kim, 2021. "A heuristic algorithm for identical parallel machine scheduling: splitting jobs, sequence-dependent setup times, and limited setup operators," Flexible Services and Manufacturing Journal, Springer, vol. 33(4), pages 992-1026, December.
    14. Janiak, Adam & Krysiak, Tomasz & Pappis, Costas P. & Voutsinas, Theodore G., 2009. "A scheduling problem with job values given as a power function of their completion times," European Journal of Operational Research, Elsevier, vol. 193(3), pages 836-848, March.
    15. D Biskup & M Feldmann, 2006. "Lot streaming with variable sublots: an integer programming formulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 296-303, March.
    16. 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.
    17. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    18. Shi, Yuhui & Reich, Daniel & Epelman, Marina & Klampfl, Erica & Cohn, Amy, 2017. "An analytical approach to prototype vehicle test scheduling," Omega, Elsevier, vol. 67(C), pages 168-176.
    19. Nodari Vakhania, 2019. "Dynamic Restructuring Framework for Scheduling with Release Times and Due-Dates," Mathematics, MDPI, vol. 7(11), pages 1-42, November.
    20. Lagodimos, A. G. & Leopoulos, V., 2000. "Greedy heuristic algorithms for manpower shift planning," International Journal of Production Economics, Elsevier, vol. 68(1), pages 95-106, October.

    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:109:y:1998:i:3:p:620-631. 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.