Scheduling tasks with failure probabilities to minimize expected cost
Author
Abstract
Suggested Citation
DOI: 10.1002/1520-6750(199002)37:13.0.CO;2-5
Download full text from publisher
References listed on IDEAS
- Clyde L. Monma & Jeffrey B. Sidney, 1979. "Sequencing with Series-Parallel Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 4(3), pages 215-224, August.
- Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Mericcan Usta & Feryal Erhun & Warren H. Hausman, 2014. "Supply licensing when the manufacturer strategically commits to invest in R&D," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(4), pages 341-350, June.
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.- Robbert Fokkink & Thomas Lidbetter & László A. Végh, 2019. "On Submodular Search and Machine Scheduling," Management Science, INFORMS, vol. 44(4), pages 1431-1449, November.
- Lidbetter, Thomas, 2020. "Search and rescue in the face of uncertain threats," European Journal of Operational Research, Elsevier, vol. 285(3), pages 1153-1160.
- Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
- Agnetis, Alessandro & Hermans, Ben & Leus, Roel & Rostami, Salim, 2022. "Time-critical testing and search problems," European Journal of Operational Research, Elsevier, vol. 296(2), pages 440-452.
- Ben Hermans & Roel Leus & Jannik Matuschke, 2022. "Exact and Approximation Algorithms for the Expanding Search Problem," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 281-296, January.
- Murali Agastya & Oleksii Birulin, 2023. "Optimal Task Scheduling under Adverse Selection and Hidden Actions," American Economic Journal: Microeconomics, American Economic Association, vol. 15(2), pages 660-698, May.
- Marieke Quant & Marc Meertens & Hans Reijnierse, 2008.
"Processing games with shared interest,"
Annals of Operations Research, Springer, vol. 158(1), pages 219-228, February.
- Quant, M. & Meertens, M. & Reijnierse, J.H., 2004. "Processing Games with Shared Interest," Other publications TiSEM 016ac415-c70e-453f-acfb-a, Tilburg University, School of Economics and Management.
- Quant, M. & Meertens, M. & Reijnierse, J.H., 2008. "Processing games with shared interest," Other publications TiSEM e83018e2-d6fb-4829-b6eb-f, Tilburg University, School of Economics and Management.
- Quant, M. & Meertens, M. & Reijnierse, J.H., 2004. "Processing Games with Shared Interest," Discussion Paper 2004-126, Tilburg University, Center for Economic Research.
- Lili Liu & Guochun Tang & Baoqiang Fan & Xingpeng Wang, 2015. "Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 938-948, November.
- van Beek, Andries & Malmberg, Benjamin & Borm, Peter & Quant, Marieke & Schouten, Jop, 2021.
"Cooperation and Competition in Linear Production and Sequencing Processes,"
Discussion Paper
2021-011, Tilburg University, Center for Economic Research.
- van Beek, Andries & Malmberg, Benjamin & Borm, Peter & Quant, Marieke & Schouten, Jop, 2021. "Cooperation and Competition in Linear Production and Sequencing Processes," Other publications TiSEM fd7a301b-7ef3-4142-835d-a, Tilburg University, School of Economics and Management.
- Reijnierse, Hans & Borm, Peter & Quant, Marieke & Meertens, Marc, 2010.
"Processing games with restricted capacities,"
European Journal of Operational Research, Elsevier, vol. 202(3), pages 773-780, May.
- Meertens, M. & Borm, P.E.M. & Reijnierse, J.H. & Quant, M., 2004. "Processing Games with Restricted Capacities," Other publications TiSEM a769e434-b8c9-4116-8897-f, Tilburg University, School of Economics and Management.
- Meertens, M. & Borm, P.E.M. & Reijnierse, J.H. & Quant, M., 2004. "Processing Games with Restricted Capacities," Discussion Paper 2004-83, Tilburg University, Center for Economic Research.
- Borm, Peter & Fiestras-Janeiro, Gloria & Hamers, Herbert & Sanchez, Estela & Voorneveld, Mark, 2002.
"On the convexity of games corresponding to sequencing situations with due dates,"
European Journal of Operational Research, Elsevier, vol. 136(3), pages 616-634, February.
- Borm, P.E.M. & Fiestras-Janeiro, G. & Hamers, H.J.M. & Sánchez, E. & Voorneveld, M., 1999. "On the Convexity of Games Corresponding to Sequencing Situations with Due Dates," Other publications TiSEM 46a07ce4-57fe-4a08-bcb5-c, Tilburg University, School of Economics and Management.
- Borm, P.E.M. & Fiestras-Janeiro, G. & Hamers, H.J.M. & Sánchez, E. & Voorneveld, M., 2002. "On the convexity of games corresponding to sequencing situations with due dates," Other publications TiSEM caf52141-b0aa-42ef-96ed-e, Tilburg University, School of Economics and Management.
- Borm, P.E.M. & Fiestras-Janeiro, G. & Hamers, H.J.M. & Sánchez, E. & Voorneveld, M., 1999. "On the Convexity of Games Corresponding to Sequencing Situations with Due Dates," Discussion Paper 1999-49, Tilburg University, Center for Economic Research.
- Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
- 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.
- Hanane Krim & Rachid Benmansour & David Duvivier & Daoud Aït-Kadi & Said Hanafi, 2020. "Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance," Computational Optimization and Applications, Springer, vol. 75(1), pages 291-320, January.
- M. Musegaas & P. E. M. Borm & M. Quant, 2018.
"On the convexity of step out–step in sequencing games,"
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 68-109, April.
- Musegaas, Marieke & Borm, Peter & Quant, Marieke, 2016. "On the Convexity of Step out - Step in Sequencing Games," Discussion Paper 2016-043, Tilburg University, Center for Economic Research.
- Musegaas, Marieke & Borm, Peter & Quant, Marieke, 2016. "On the Convexity of Step out - Step in Sequencing Games," Other publications TiSEM f8a803f5-1f6a-4ac4-b4f6-7, Tilburg University, School of Economics and Management.
- Musegaas, M. & Borm, P.E.M. & Quant, M., 2015.
"Step out–Step in sequencing games,"
European Journal of Operational Research, Elsevier, vol. 246(3), pages 894-906.
- Musegaas, M. & Borm, P.E.M. & Quant, M., 2014. "Step out - Step in Sequencing Games," Discussion Paper 2014-070, Tilburg University, Center for Economic Research.
- Musegaas, M. & Borm, P.E.M. & Quant, M., 2014. "Step out - Step in Sequencing Games," Other publications TiSEM 68089383-0b91-4cc8-9d03-e, Tilburg University, School of Economics and Management.
- Atay, Ata & Trudeau, Christian, 2024.
"Queueing games with an endogenous number of machines,"
Games and Economic Behavior, Elsevier, vol. 144(C), pages 104-125.
- Ata Atay & Christian Trudeau, 2022. "Queueing games with an endogenous number of machines," Papers 2207.07190, arXiv.org, revised Nov 2022.
- Ata Atay & Christian Trudeau, 2022. "Queueing games with an endogenous number of machines," UB School of Economics Working Papers 2022/429, University of Barcelona School of Economics.
- Ata Atay & Christian Trudeau, 2022. "Queueing games with an endogenous number of machines," Working Papers 2202, University of Windsor, Department of Economics.
- Miri Gilenson & Dvir Shabtay & Liron Yedidsion & Rohit Malshe, 2021. "Scheduling in multi-scenario environment with an agreeable condition on job processing times," Annals of Operations Research, Springer, vol. 307(1), pages 153-173, December.
- Agnetis, Alessandro & Chen, Bo & Nicosia, Gaia & Pacifici, Andrea, 2019. "Price of fairness in two-agent single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 276(1), pages 79-87.
- Yang, Guangjing & Sun, Hao & Hou, Dongshuang & Xu, Genjiu, 2019. "Games in sequencing situations with externalities," European Journal of Operational Research, Elsevier, vol. 278(2), pages 699-708.
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:wly:navres:v:37:y:1990:i:1:p:99-109. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.