Skip to main content
SpringerLink
Log in

Stochastic flow shop scheduling model for the Panama Canal

  • Case-Oriented Paper
  • Published:
Journal of the Operational Research Society

Abstract

Reducing transit time is becoming increasingly important in maritime shipping of manufactured goods and commodities. Traversing the Panama Canal is a principal component of many global companies’ strategies to reduce shipping time in their supply chain. Operations in the Panama Canal can be described by a capacitated queueing network. In this study we used a metaheuristic approach based on Nested Partitions to find near optimal schedules for daily vessel traffic consisting of large vessels that want to pass through the Panama Canal. Results indicate that the metaheuristic technique consistently reduced the makespan of a set of vessels as compared to historical schedules used in canal operations. We also found distinct patterns in the schedules in which certain vessels consistently appeared at a certain position in the schedule.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5

Similar content being viewed by others

References

  • Álvarez-Pérez GA, González-Velarde JL and Fowler JW (2008). Crossdocking—Just in Time scheduling: An alternative solution approach. J Opl Res Soc, advance online publication, 1–11, 19 March 2008.

  • Etiler O, Toklu B, Atak M and Wilson J (2004). A genetic algorithm for flow shop scheduling problems . J Opl Res Soc 55: 830–835.

    Article  Google Scholar 

  • Gourgand M, Grangeon N and Norre S (2003). A contribution to the stochastic flow shop scheduling problem . Eur J Opl Res 151: 415–433.

    Article  Google Scholar 

  • Gupta JND, Ho JC and Webster S (2000). Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines . J Opl Res Soc 51: 1330–1339.

    Article  Google Scholar 

  • Hopp WJ and Spearman ML (2000). Factory Physics: Foundations of Manufacturing Management, 2nd edn. McGraw-Hill: Burr Ridge, IL.

    Google Scholar 

  • Huegler PA and Vasko FJ (2007). Metaheuristics for meltshop scheduling in the steel industry . J Opl Res Soc 58: 791–796.

    Article  Google Scholar 

  • Kamburowski J (1999). Stochastically minimizing the makespan in two-machine flow shops without blocking . Eur J Opl Res 112: 304–309.

    Article  Google Scholar 

  • Kamburowski J (2000). On three-machine flow shops with random job processing times . Eur J Opl Res 125: 440–448.

    Article  Google Scholar 

  • Kumral M and Dowd PA (2005). A simulated annealing approach to mine production scheduling . J Opl Res Soc 56: 922–930.

    Article  Google Scholar 

  • Ólafsson S (2005). Metaheuristics . In: Henderson SG, Henderson and Nelson BL (eds). Handbook of Operation Research and Management Science: Simulation. Elsevier: Amsterdam, Netherlands.

    Google Scholar 

  • Pinedo M (1982). Minimizing the expected makespan in stochastic flow shops . Opns Res 30: 148–162.

    Article  Google Scholar 

  • Pinedo M (2002). Scheduling: Theory, Algorithm, and Systems . Prentice Hall: Englewood Cliffs, NJ.

    Google Scholar 

  • Pinedo M (2005). Planning and Scheduling in Manufacturing and Services . Springer: New York.

    Google Scholar 

  • Shi L and Ólafsson S (1997). An integrated framework for deterministic and stochastic optimization . In: Andradbttir S, Healy KJ, Withers DH and Nelson BL (eds). Proceedings of the 1997 Winter Simulation Conference, pp. 358–365.

  • Shi L and Ólafsson S (2008). Nested Partitions Optimization: Methodology and Applications . In: International Series in Operations Research & Management Science Vol. 109. Springer: New York, NY.

    Google Scholar 

  • Vasquez R (2003). Economic forces in the decision-making process of the Panama Canal . Marit Econ Log 5: 219–223.

    Article  Google Scholar 

  • Voss S (2001). Metaheuristics: The state of the art . In: Nareyek A (ed). Local Search for Planning and Scheduling, Lectures Notes in Comp Sci. Vol. 2148. Springer: Berlin, Germany, pp. 1–23.

    Chapter  Google Scholar 

  • Voss S, Osman IH and Roucairol C (eds) (1999). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers: Norwell, MA.

Download references

Acknowledgements

This research was partially supported by the Panama National Secretary of Science and Technology (Senacyt) and the Fulbright Foundation.

Author information

Authors and Affiliations

  1. Iowa State University, Ames, Iowa, USA

    J Jackman & S Olafsson

  2. Universidad Tecnológicade Panamá, Panama

    Z Guerra de Castillo

Authors
  1. J Jackman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Z Guerra de Castillo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S Olafsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J Jackman.

Appendix

Appendix

Table A1 and A2

Table a1 Northbound distributions
Full size table
Table a2 Southbound distributions
Full size table

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jackman, J., Guerra de Castillo, Z. & Olafsson, S. Stochastic flow shop scheduling model for the Panama Canal. J Oper Res Soc 62, 69–80 (2011). https://doi.org/10.1057/jors.2009.188

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2009.188

Keywords

Search

Navigation