IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v44y1997i5p427-440.html
   My bibliography  Save this article

Job-shop resource scheduling via simulating random operations

Author

Listed:
  • Golenko-Ginzburg, Dimitri
  • Gonik, Aharon

Abstract

We are concerned with a problem of scheduling a flexible manufacturing cell with random time operations. A job-shop production section comprises a set of n jobs (orders) and a set of m machines (processors). Each order consists of a chain of operations, each of which needs to be executed during an uninterrupted period on a given processor. Each operation is carried out under random disturbances. For each order, its due date and the probability of meeting the deadline on time are pregiven. Orders are of different importance and a priority index has to be set for each order by the management, i.e. by practitioners who are responsible for the job-shop. Certain operations need additional resources to be delivered beforehand (equipment, experimental stations, etc.) to process these operations.

Suggested Citation

  • Golenko-Ginzburg, Dimitri & Gonik, Aharon, 1997. "Job-shop resource scheduling via simulating random operations," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 44(5), pages 427-440.
    • Handle: RePEc:eee:matcom:v:44:y:1997:i:5:p:427-440
    DOI: 10.1016/S0378-4754(97)00074-8
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475497000748
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/S0378-4754(97)00074-8?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
    ---><---

    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. Michael Pinedo, 1983. "Stochastic Scheduling with Release Dates and Due Dates," Operations Research, INFORMS, vol. 31(3), pages 559-572, June.
    2. Michael Pinedo, 1982. "Minimizing the Expected Makespan in Stochastic Flow Shops," Operations Research, INFORMS, vol. 30(1), pages 148-162, February.
    3. Golenko-Ginzburg, Dimitri & Kesler, Shmuel & Landsman, Zinoviy, 1995. "Industrial job-shop scheduling with random operations and different priorities," International Journal of Production Economics, Elsevier, vol. 40(2-3), pages 185-195, 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. Xu, Jiuping & Tao, Zhimiao, 2012. "A class of multi-objective equilibrium chance maximization model with twofold random phenomenon and its application to hydropower station operation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 85(C), pages 11-33.
    2. Dimitri, Golenko-Ginzburg & Shimon, Sitniakovski & Ljubisa, Papic, 2000. "Resource supportability simulation model for a man–machine production system," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 53(1), pages 105-112.

    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. 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.
    2. Golenko-Ginzburg, Dimitri & Gonik, Aharon, 1997. "Using "look ahead" techniques in job-shop scheduling with random operations," International Journal of Production Economics, Elsevier, vol. 50(1), pages 13-22, May.
    3. Golenko-Ginzburg, Dimitri & Kesler, Shmuel & Landsman, Zinoviy, 1995. "Industrial job-shop scheduling with random operations and different priorities," International Journal of Production Economics, Elsevier, vol. 40(2-3), pages 185-195, August.
    4. J Jackman & Z Guerra de Castillo & S Olafsson, 2011. "Stochastic flow shop scheduling model for the Panama Canal," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 69-80, January.
    5. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    6. P J Kalczynski & J Kamburowski, 2004. "Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1358-1362, December.
    7. 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.
    8. 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.
    9. Charles Du & Michael Pinedo, 1995. "A note on minimizing the expected makespan in flowshops subject to breakdowns," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(8), pages 1251-1262, December.
    10. 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).
    11. 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.
    12. Lee, Kangbok & Zheng, Feifeng & Pinedo, Michael L., 2019. "Online scheduling of ordered flow shops," European Journal of Operational Research, Elsevier, vol. 272(1), pages 50-60.
    13. Portougal, Victor & Trietsch, Dan, 2006. "Johnson's problem with stochastic processing times and optimal service level," European Journal of Operational Research, Elsevier, vol. 169(3), pages 751-760, March.
    14. Zhankun Sun & Nilay Tan?k Argon & Serhan Ziya, 2018. "Patient Triage and Prioritization Under Austere Conditions," Management Science, INFORMS, vol. 64(10), pages 4471-4489, October.
    15. Gourgand, Michel & Grangeon, Nathalie & Norre, Sylvie, 2005. "Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity," European Journal of Operational Research, Elsevier, vol. 161(1), pages 126-147, February.
    16. Sheldon M. Ross, 2015. "A sequential scheduling problem with impatient jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(8), pages 659-663, December.
    17. Yin, Yunqiang & Luo, Zunhao & Wang, Dujuan & Cheng, T.C.E., 2023. "Wasserstein distance‐based distributionally robust parallel‐machine scheduling," Omega, Elsevier, vol. 120(C).
    18. Jonathan Bard & David Morton & Yong Wang, 2007. "Workforce planning at USPS mail processing and distribution centers using stochastic optimization," Annals of Operations Research, Springer, vol. 155(1), pages 51-78, November.
    19. 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.
    20. Huiyin Ouyang & Nilay Taník Argon & Serhan Ziya, 2022. "Assigning Priorities (or Not) in Service Systems with Nonlinear Waiting Costs," Management Science, INFORMS, vol. 68(2), pages 1233-1255, February.

    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:matcom:v:44:y:1997:i:5:p:427-440. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.