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

Complexity of flow shop scheduling problems with transportation constraints

Author

Listed:
  • Soukhal, A.
  • Oulamara, A.
  • Martineau, P.

Abstract

No abstract is available for this item.

Suggested Citation

  • Soukhal, A. & Oulamara, A. & Martineau, P., 2005. "Complexity of flow shop scheduling problems with transportation constraints," European Journal of Operational Research, Elsevier, vol. 161(1), pages 32-41, February.
    • Handle: RePEc:eee:ejores:v:161:y:2005:i:1:p:32-41
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00532-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. 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.
    2. C.A. Glass & C.N. Potts & V.A. Strusevich, 2001. "Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 120-137, May.
    3. Javad H. Ahmadi & Reza H. Ahmadi & Sriram Dasu & Christopher S. Tang, 1992. "Batching and Scheduling Jobs on Batch and Discrete Processors," Operations Research, INFORMS, vol. 40(4), pages 750-763, 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. Jason Pan & Chi-Shiang Su, 2015. "Two parallel machines problem with job delivery coordination and availability constraint," Annals of Operations Research, Springer, vol. 235(1), pages 653-664, December.
    2. Chen, Bo & Lee, Chung-Yee, 2008. "Logistics scheduling with batching and transportation," European Journal of Operational Research, Elsevier, vol. 189(3), pages 871-876, September.
    3. Mohammad Reza Komari Alaei & Mehmet Soysal & Atabak Elmi & Audrius Banaitis & Nerija Banaitiene & Reza Rostamzadeh & Shima Javanmard, 2021. "A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell," Mathematics, MDPI, vol. 9(15), pages 1-15, July.
    4. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    5. Madiha Harrabi & Olfa Belkahla Driss & Khaled Ghedira, 2021. "A hybrid evolutionary approach to job-shop scheduling with generic time lags," Journal of Scheduling, Springer, vol. 24(3), pages 329-346, June.
    6. Mohammadi, S. & Al-e-Hashem, S.M.J. Mirzapour & Rekik, Y., 2020. "An integrated production scheduling and delivery route planning with multi-purpose machines: A case study from a furniture manufacturing company," International Journal of Production Economics, Elsevier, vol. 219(C), pages 347-359.
    7. S. Mohammadi & S. Al-E-Hashem & Yacine Rekik, 2020. "An integrated production scheduling and delivery route planning with multi-purpose machines: A case study from a furniture manufacturing company," Post-Print hal-02194222, HAL.
    8. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    9. Yuan, Jinjiang & Soukhal, Ameur & Chen, Youjun & Lu, Lingfa, 2007. "A note on the complexity of flow shop scheduling with transportation constraints," European Journal of Operational Research, Elsevier, vol. 178(3), pages 918-925, May.
    10. Irina N. Lushchakova & Alan J. Soper & Vitaly A. Strusevich, 2009. "Transporting jobs through a two‐machine open shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(1), pages 1-18, February.
    11. Vis, Iris F.A., 2006. "Survey of research in the design and control of automated guided vehicle systems," European Journal of Operational Research, Elsevier, vol. 170(3), pages 677-709, May.

    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. Yuan, Jinjiang & Soukhal, Ameur & Chen, Youjun & Lu, Lingfa, 2007. "A note on the complexity of flow shop scheduling with transportation constraints," European Journal of Operational Research, Elsevier, vol. 178(3), pages 918-925, May.
    2. Lin, B.M.T. & Cheng, T.C.E. & Chou, A.S.C., 2007. "Scheduling in an assembly-type production chain with batch transfer," Omega, Elsevier, vol. 35(2), pages 143-151, April.
    3. B. Lin & T. Cheng, 2005. "Two-Machine Flowshop Batching and Scheduling," Annals of Operations Research, Springer, vol. 133(1), pages 149-161, January.
    4. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    5. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    6. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    7. Esswein, Carl & Billaut, Jean-Charles & Strusevich, Vitaly A., 2005. "Two-machine shop scheduling: Compromise between flexibility and makespan value," European Journal of Operational Research, Elsevier, vol. 167(3), pages 796-809, December.
    8. Weiya Zhong & Yun Shi, 2018. "Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 108-125, January.
    9. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2022. "Online algorithms to schedule a proportionate flexible flow shop of batching machines," Journal of Scheduling, Springer, vol. 25(6), pages 643-657, December.
    10. Chang, Yung-Chia & Lee, Chung-Yee, 2004. "Machine scheduling with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 158(2), pages 470-487, October.
    11. 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.
    12. 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.
    13. 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.
    14. Gregory Dobson & Ramakrishnan S. Nambimadom, 2001. "The Batch Loading and Scheduling Problem," Operations Research, INFORMS, vol. 49(1), pages 52-65, February.
    15. 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.
    16. 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.
    17. 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.
    18. Allahverdi, Ali, 1999. "Stochastically minimizing total flowtime in flowshops with no waiting space," European Journal of Operational Research, Elsevier, vol. 113(1), pages 101-112, February.
    19. Raaymakers, W. H. M. & Hoogeveen, J. A., 2000. "Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing," European Journal of Operational Research, Elsevier, vol. 126(1), pages 131-151, October.
    20. Gur Mosheiov & Daniel Oron, 2011. "Batch scheduling on a two‐machine jobshop with machine‐dependent setup times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(7), pages 676-684, 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:161:y:2005:i:1:p:32-41. 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.