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

Dynamic scheduling of stochastic jobs on a single machine

Author

Listed:
  • Jang, Wooseung

Abstract

No abstract is available for this item.

Suggested Citation

  • Jang, Wooseung, 2002. "Dynamic scheduling of stochastic jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 138(3), pages 518-530, May.
    • Handle: RePEc:eee:ejores:v:138:y:2002:i:3:p:518-530
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(01)00174-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Stephen J. Balut, 1973. "Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain," Management Science, INFORMS, vol. 19(11), pages 1283-1288, July.
    2. Michael Pinedo, 1983. "Stochastic Scheduling with Release Dates and Due Dates," Operations Research, INFORMS, vol. 31(3), pages 559-572, June.
    3. Sarin, Subhash C. & Erel, Erdal & Steiner, George, 1991. "Sequencing jobs on a single machine with a common due date and stochastic processing times," European Journal of Operational Research, Elsevier, vol. 51(2), pages 188-198, March.
    4. Cheng-Shang Chang & David D. Yao, 1993. "Rearrangement, Majorization and Stochastic Scheduling," Mathematics of Operations Research, INFORMS, vol. 18(3), pages 658-684, August.
    5. Soroush, H. M. & Fredendall, L. D., 1994. "The stochastic single machine scheduling problem with earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 77(2), pages 287-302, September.
    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. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    2. Sagawa, Juliana Keiko & Nagano, Marcelo Seido, 2015. "Modeling the dynamics of a multi-product manufacturing system: A real case application," European Journal of Operational Research, Elsevier, vol. 244(2), pages 624-636.
    3. Soroush, H.M., 2007. "Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 181(1), pages 266-287, August.
    4. Chang, Zhiqi & Song, Shiji & Zhang, Yuli & Ding, Jian-Ya & Zhang, Rui & Chiong, Raymond, 2017. "Distributionally robust single machine scheduling with risk aversion," European Journal of Operational Research, Elsevier, vol. 256(1), pages 261-274.

    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. Xiaoqiang Cai & Sean Zhou, 1999. "Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs," Operations Research, INFORMS, vol. 47(3), pages 422-437, June.
    2. 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.
    3. Soroush, H.M., 2007. "Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 181(1), pages 266-287, August.
    4. Soroush, H. M., 1999. "Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 113(2), pages 450-468, March.
    5. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    6. Yang, Bibo & Geunes, Joseph, 2008. "Predictive-reactive scheduling on a single resource with uncertain future jobs," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1267-1283, September.
    7. Ramesh Bollapragada & Norman M. Sadeh, 2004. "Proactive release procedures for just‐in‐time job shop environments, subject to machine failures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(7), pages 1018-1044, October.
    8. Alcaide, David & Rodriguez-Gonzalez, Andrés & Sicilia, Joaquín, 2003. "An approach to solve a hierarchical stochastic sequential ordering problem," Omega, Elsevier, vol. 31(3), pages 169-187, June.
    9. Susan H. Xu & Haijun Li, 2000. "Majorization of Weighted Trees: A New Tool to Study Correlated Stochastic Systems," Mathematics of Operations Research, INFORMS, vol. 25(2), pages 298-323, May.
    10. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    11. Kolahan, F. & Liang, M., 1998. "An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 109(1), pages 142-159, August.
    12. Brian C. Dean & Michel X. Goemans & Jan Vondrák, 2008. "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 945-964, November.
    13. Lemos, R.F. & Ronconi, D.P., 2015. "Heuristics for the stochastic single-machine problem with E/T costs," International Journal of Production Economics, Elsevier, vol. 168(C), pages 131-142.
    14. Setareh Boshrouei Shargh & Mostafa Zandieh & Ashkan Ayough & Farbod Farhadi, 2024. "Scheduling in services: a review and bibliometric analysis," Operations Management Research, Springer, vol. 17(2), pages 754-783, June.
    15. Golenko-Ginzburg, Dimitri & Gonik, Aharon, 2002. "Optimal job-shop scheduling with random operations and cost objectives," International Journal of Production Economics, Elsevier, vol. 76(2), pages 147-157, March.
    16. Trietsch, Dan & Mazmanyan, Lilit & Gevorgyan, Lilit & Baker, Kenneth R., 2012. "Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation," European Journal of Operational Research, Elsevier, vol. 216(2), pages 386-396.
    17. Marbán Sebastián & Rutten Cyriel & Vredeveld Tjark, 2010. "Asymptotic optimality of SEPT in Bayesian Scheduling," Research Memorandum 051, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    18. Zhankun Sun & Nilay Tanık Argon & Serhan Ziya, 2022. "When to Triage in Service Systems with Hidden Customer Class Identities?," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 172-193, January.
    19. Zhuang, Weifen & Li, Michael Z.F., 2012. "Monotone optimal control for a class of Markov decision processes," European Journal of Operational Research, Elsevier, vol. 217(2), pages 342-350.
    20. Arthur Charpentier & Lariosse Kouakou & Matthias Lowe & Philipp Ratz & Franck Vermet, 2021. "Collaborative Insurance Sustainability and Network Structure," Papers 2107.02764, arXiv.org, revised Sep 2022.

    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:138:y:2002:i:3:p:518-530. 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.