IDEAS home Printed from https://ideas.repec.org/a/ags/jloagb/59606.html
   My bibliography  Save this article

Impact of Sugarcane Delivery Schedule on Product Value at Raw Sugar Factories

Author

Listed:
  • Salassi, Michael E.
  • Garcia, Mercedes
  • Breaux, Janis B.
  • No, Sung Chul

Abstract

Conversion to combine harvesters has resulted in Louisiana sugarcane growers delivering a more perishable product to raw sugar factories. Dextran formation increases as the time between harvest and milling is extended. Milling of freshly cut sugarcane reduces the formation of dextran and associated economic losses. One approach available to factories to reduce dextran formation is to extend the harvested sugarcane delivery schedule to the mill. A simulation model was developed to evaluate alternative delivery schedules at raw sugar factories. Economic losses in product value associated with dextran formation were estimated and compared for various extended delivery schedules.

Suggested Citation

  • Salassi, Michael E. & Garcia, Mercedes & Breaux, Janis B. & No, Sung Chul, 2004. "Impact of Sugarcane Delivery Schedule on Product Value at Raw Sugar Factories," Journal of Agribusiness, Agricultural Economics Association of Georgia, vol. 22(1), pages 1-15.
    • Handle: RePEc:ags:jloagb:59606
    DOI: 10.22004/ag.econ.59606
    as

    Download full text from publisher

    File URL: https://ageconsearch.umn.edu/record/59606/files/S04-05.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.22004/ag.econ.59606?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Nicholas G. Hall & Marc E. Posner, 1991. "Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 836-846, October.
    2. Nicholas G. Hall & Wieslaw Kubiak & Suresh P. Sethi, 1991. "Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 847-856, October.
    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. Marcos A. Rangel & Tom Vogl, 2016. "Agricultural Fires and Infant Health," NBER Working Papers 22955, National Bureau of Economic Research, Inc.
    2. Kamal Lamsal & Philip C. Jones & Barrett W. Thomas, 2017. "Sugarcane Harvest Logistics in Brazil," Transportation Science, INFORMS, vol. 51(2), pages 771-789, May.
    3. Marcos A. Rangel & Tom S. Vogl, 2016. "Agricultural Fires and Infant Health," Working Papers rangel_vogl_fires.pdf, Princeton University, Woodrow Wilson School of Public and International Affairs, Research Program in Development Studies..
    4. Marcos A. Rangel & Tom S. Vogl, 2019. "Agricultural Fires and Health at Birth," The Review of Economics and Statistics, MIT Press, vol. 101(4), pages 616-630, October.

    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. G A Álvarez-Pérez & J L González-Velarde & J W Fowler, 2009. "Crossdocking— Just in Time scheduling: an alternative solution approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 554-564, April.
    2. X. Cai & F. S. Tu, 1996. "Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early‐tardy penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1127-1146, December.
    3. Li, Y. & Ip, W. H. & Wang, D. W., 1998. "Genetic algorithm approach to earliness and tardiness production scheduling and planning problem," International Journal of Production Economics, Elsevier, vol. 54(1), pages 65-76, January.
    4. Chen, Wei-Yang & Sheen, Gwo-Ji, 2007. "Single-machine scheduling with multiple performance measures: Minimizing job-dependent earliness and tardiness subject to the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 109(1-2), pages 214-229, September.
    5. Ji-Bo Wang & Bo Cui & Ping Ji & Wei-Wei Liu, 2021. "Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 290-303, February.
    6. Philip Kaminsky & Onur Kaya, 2008. "Scheduling and due‐date quotation in a make‐to‐order supply chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 444-458, August.
    7. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    8. Helmut A. Sedding, 2020. "Scheduling jobs with a V-shaped time-dependent processing time," Journal of Scheduling, Springer, vol. 23(6), pages 751-768, December.
    9. Baruch Mor & Gur Mosheiov, 2022. "Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection," Operational Research, Springer, vol. 22(3), pages 2707-2719, July.
    10. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    11. Cai, X., 1996. "V-shape property for job sequences that minimize the expected completion time variance," European Journal of Operational Research, Elsevier, vol. 91(1), pages 118-123, May.
    12. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.
    13. Feifeng Zheng & E. Zhang & Yinfeng Xu & Wei-Chiang Hong, 2014. "Competitive analysis for make-to-order scheduling with reliable lead time quotation," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 182-198, January.
    14. Chung‐Lun Li & Edward C. Sewell & T. C. E. Cheng, 1995. "Scheduling to minimize release‐time resource consumption and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 949-966, September.
    15. Cai, X. & Lum, V. Y. S. & Chan, J. M. T., 1997. "Scheduling about a common due date with kob-dependent asymmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 98(1), pages 154-168, April.
    16. X. Cai & S. Zhou, 1997. "Scheduling stochastic jobs with asymmetric earliness and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(6), pages 531-557, September.
    17. Esteve, B. & Aubijoux, C. & Chartier, A. & T'kindt, V., 2006. "A recovering beam search algorithm for the single machine Just-in-Time scheduling problem," European Journal of Operational Research, Elsevier, vol. 172(3), pages 798-813, August.
    18. Yuan, Jinjiang, 1996. "A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs," European Journal of Operational Research, Elsevier, vol. 94(1), pages 203-205, October.
    19. N. V. R. Mahadev & Aleksandar Pekeč & Fred S. Roberts, 1998. "On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?," Operations Research, INFORMS, vol. 46(3-supplem), pages 120-134, June.
    20. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.

    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:ags:jloagb:59606. 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: AgEcon Search (email available below). General contact details of provider: https://edirc.repec.org/data/aeaggea.html .

    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.