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

An iterative improvement approach for the nonpreemptive open shop scheduling problem

Author

Listed:
  • Liaw, Ching-Fang

Abstract

No abstract is available for this item.

Suggested Citation

  • Liaw, Ching-Fang, 1998. "An iterative improvement approach for the nonpreemptive open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 111(3), pages 509-517, December.
    • Handle: RePEc:eee:ejores:v:111:y:1998:i:3:p:509-517
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00366-4
    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. Thomas R. Sexton & Lawrence D. Bodin, 1985. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling," Transportation Science, INFORMS, vol. 19(4), pages 378-410, November.
    2. Tibor Fiala, 1983. "An Algorithm for the Open-Shop Problem," Mathematics of Operations Research, INFORMS, vol. 8(1), pages 100-109, February.
    3. Thomas R. Sexton & Lawrence D. Bodin, 1985. "Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing," Transportation Science, INFORMS, vol. 19(4), pages 411-435, November.
    4. Bo Chen & Vitaly A. Strusevich, 1993. "Approximation Algorithms for Three-Machine Open Shop Scheduling," INFORMS Journal on Computing, INFORMS, vol. 5(3), pages 321-326, 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. Selcuk Colak & Anurag Agarwal, 2005. "Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(7), pages 631-644, October.
    2. 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.
    3. Liaw, Ching-Fang, 2000. "A hybrid genetic algorithm for the open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 124(1), pages 28-42, July.

    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. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    2. Fagerholt, Kjetil, 2001. "Ship scheduling with soft time windows: An optimisation based approach," European Journal of Operational Research, Elsevier, vol. 131(3), pages 559-571, June.
    3. Matteo Salani & Maria Battarra, 2018. "The opportunity cost of time window violations," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(4), pages 343-361, December.
    4. Han Zheng & Junhua Chen & Xingchen Zhang & Zixian Yang, 2019. "Designing a New Shuttle Service to Meet Large-Scale Instantaneous Peak Demands for Passenger Transportation in a Metropolitan Context: A Green, Low-Cost Mass Transport Option," Sustainability, MDPI, vol. 11(18), pages 1-28, September.
    5. Velaga, Nagendra R. & Beecroft, Mark & Nelson, John D. & Corsar, David & Edwards, Peter, 2012. "Transport poverty meets the digital divide: accessibility and connectivity in rural communities," Journal of Transport Geography, Elsevier, vol. 21(C), pages 102-112.
    6. Luo, Ying & Schonfeld, Paul, 2007. "A rejected-reinsertion heuristic for the static Dial-A-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 41(7), pages 736-755, August.
    7. Christian Pfeiffer & Arne Schulz, 2022. "An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 87-119, March.
    8. Shaohua Cui & Hui Zhao & Cuiping Zhang, 2018. "Multiple Types of Plug-In Charging Facilities’ Location-Routing Problem with Time Windows for Mobile Charging Vehicles," Sustainability, MDPI, vol. 10(8), pages 1-26, August.
    9. K Fagerholt & B A Foss & O J Horgen, 2009. "A decision support model for establishing an air taxi service: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1173-1182, September.
    10. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    11. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    12. Qie He & Stefan Irnich & Yongjia Song, 2018. "Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Working Papers 1804, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    13. Jean-François Cordeau & Gilbert Laporte, 2007. "The dial-a-ride problem: models and algorithms," Annals of Operations Research, Springer, vol. 153(1), pages 29-46, September.
    14. K Fagerholt & G Laporte & I Norstad, 2010. "Reducing fuel emissions by optimizing speed on shipping routes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(3), pages 523-529, March.
    15. Desaulniers, Guy & Lavigne, June & Soumis, Francois, 1998. "Multi-depot vehicle scheduling problems with time windows and waiting costs," European Journal of Operational Research, Elsevier, vol. 111(3), pages 479-494, December.
    16. Hideki Hashimoto & Mutsunori Yagiura & Shinji Imahori & Toshihide Ibaraki, 2013. "Recent progress of local search in handling the time window constraints of the vehicle routing problem," Annals of Operations Research, Springer, vol. 204(1), pages 171-187, April.
    17. Mitrovic-Minic, Snezana & Laporte, Gilbert, 2004. "Waiting strategies for the dynamic pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(7), pages 635-655, August.
    18. Häme, Lauri, 2011. "An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows," European Journal of Operational Research, Elsevier, vol. 209(1), pages 11-22, February.
    19. Psaraftis, Harilaos N., 2011. "A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases," European Journal of Operational Research, Elsevier, vol. 215(3), pages 572-580, December.
    20. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.

    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:111:y:1998:i:3:p:509-517. 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.