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

Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock

Author

Listed:
  • Nauss, Robert M.

Abstract

No abstract is available for this item.

Suggested Citation

  • Nauss, Robert M., 2008. "Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1268-1281, June.
    • Handle: RePEc:eee:ejores:v:187:y:2008:i:3:p:1268-1281
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00836-8
    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. Lee, Sang M. & Asllani, Arben A., 2004. "Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming," Omega, Elsevier, vol. 32(2), pages 145-153, April.
    2. J. William Gavett, 1965. "Three Heuristic Rules for Sequencing Jobs to a Single Production Facility," Management Science, INFORMS, vol. 11(8), pages 166-176, June.
    3. R. D. Haynes & C. A. Komar & Jack Byrd, Jr., 1973. "The Effectiveness of Three Heuristic Rules for Job Sequencing in a Single Production Facility," Management Science, INFORMS, vol. 19(5), pages 575-580, January.
    4. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    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. L D Smith & D C Sweeney & J F Campbell, 2009. "Simulation of alternative approaches to relieving congestion at locks in a river transportion system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 519-533, April.
    2. Elio Canestrelli & Marco Corazza & Giuseppe Nadai & Raffaele Pesenti, 2017. "Managing the Ship Movements in the Port of Venice," Networks and Spatial Economics, Springer, vol. 17(3), pages 861-887, September.
    3. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    4. T. Edward Yu & Bijay P. Sharma & Burton C. English, 2019. "Investigating Lock Delay on the Upper Mississippi River: a Spatial Panel Analysis," Networks and Spatial Economics, Springer, vol. 19(1), pages 275-291, March.
    5. Passchyn, Ward & Coene, Sofie & Briskorn, Dirk & Hurink, Johann L. & Spieksma, Frits C.R. & Vanden Berghe, Greet, 2016. "The lockmaster’s problem," European Journal of Operational Research, Elsevier, vol. 251(2), pages 432-441.
    6. Shuai Jia & Chung-Lun Li & Zhou Xu, 2019. "Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port," Transportation Science, INFORMS, vol. 53(3), pages 728-745, May.
    7. Buchem, Moritz & Golak, Julian Arthur Pawel & Grigoriev, Alexander, 2022. "Vessel velocity decisions in inland waterway transportation under uncertainty," European Journal of Operational Research, Elsevier, vol. 296(2), pages 669-678.
    8. Verstichel, J. & De Causmaecker, P. & Spieksma, F.C.R. & Vanden Berghe, G., 2014. "Exact and heuristic methods for placing ships in locks," European Journal of Operational Research, Elsevier, vol. 235(2), pages 387-398.
    9. Lijuan Yang & Eldon Y. Li & Yu Zhang, 2020. "Pricing and Subsidy Models for Transshipment Sustainability in the Three Gorges Dam Region of China," Sustainability, MDPI, vol. 12(17), pages 1-20, August.
    10. Sweeney, Kevin D. & Sweeney, Donald C. & Campbell, James F., 2019. "The performance of priority dispatching rules in a complex job shop: A study on the Upper Mississippi River," International Journal of Production Economics, Elsevier, vol. 216(C), pages 154-172.
    11. Passchyn, Ward & Briskorn, Dirk & Spieksma, Frits C.R., 2016. "Mathematical programming models for lock scheduling with an emission objective," European Journal of Operational Research, Elsevier, vol. 248(3), pages 802-814.
    12. Ji, Bin & Zhang, Dezhi & Yu, Samson S. & Zhang, Binqiao, 2021. "Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective," European Journal of Operational Research, Elsevier, vol. 288(1), pages 47-62.
    13. Ji, Bin & Zhang, Dezhi & Zhang, Zheng & Yu, Samson S. & Van Woensel, Tom, 2022. "The generalized serial-lock scheduling problem on inland waterway: A novel decomposition-based solution framework and efficient heuristic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    14. Caris, An & Limbourg, Sabine & Macharis, Cathy & van Lier, Tom & Cools, Mario, 2014. "Integration of inland waterway transport in the intermodal supply chain: a taxonomy of research challenges," Journal of Transport Geography, Elsevier, vol. 41(C), pages 126-136.

    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. Liao, C. J. & Yu, W. C., 1996. "Sequencing heuristics for dependent setups in a continuous process industry," Omega, Elsevier, vol. 24(6), pages 649-659, December.
    2. Martin, Clarence H, 2009. "A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming," Omega, Elsevier, vol. 37(1), pages 126-137, February.
    3. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    4. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    5. Melissa R. Bowers & Anurag Agarwal, 2007. "Fewer Equipment Changeovers for the Embroidery Process at Oxford Industries," Interfaces, INFORMS, vol. 37(6), pages 526-538, December.
    6. Marko Ɖurasević & Domagoj Jakobović, 2019. "Creating dispatching rules by simple ensemble combination," Journal of Heuristics, Springer, vol. 25(6), pages 959-1013, December.
    7. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    8. Ravindran Vijayalakshmi, Vipin & Schröder, Marc & Tamir, Tami, 2024. "Minimizing total completion time with machine-dependent priority lists," European Journal of Operational Research, Elsevier, vol. 315(3), pages 844-854.
    9. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    10. Havill, Jessen T. & Mao, Weizhen, 2008. "Competitive online scheduling of perfectly malleable jobs with setup times," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1126-1142, June.
    11. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.
    12. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    13. 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.
    14. Claassen, G.D.H., 2014. "Mixed integer (0–1) fractional programming for decision support in paper production industry," Omega, Elsevier, vol. 43(C), pages 21-29.
    15. Mohammad Reza Hosseinzadeh & Mehdi Heydari & Mohammad Mahdavi Mazdeh, 2022. "Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time," Operational Research, Springer, vol. 22(5), pages 5055-5105, November.
    16. Allahverdi, Ali, 2006. "Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times," International Journal of Production Economics, Elsevier, vol. 103(1), pages 386-400, September.
    17. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    18. Sheikh, Shaya & Komaki, G.M. & Kayvanfar, Vahid & Teymourian, Ehsan, 2019. "Multi-Stage assembly flow shop with setup time and release time," Operations Research Perspectives, Elsevier, vol. 6(C).
    19. Alessandro Agnetis & Arianna Alfieri & Gaia Nicosia, 2009. "Single-Machine Scheduling Problems with Generalized Preemption," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 1-12, February.
    20. Ciavotta, Michele & Detti, Paolo & Meloni, Carlo & Pranzo, Marco, 2008. "A bi-objective coordination setup problem in a two-stage production system," European Journal of Operational Research, Elsevier, vol. 189(3), pages 734-745, 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:187:y:2008:i:3:p:1268-1281. 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.