IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v41y1995i2p363-376.html
   My bibliography  Save this item

Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Ng, Tsan Sheng, 2013. "Robust regret for uncertain linear programs with application to co-production models," European Journal of Operational Research, Elsevier, vol. 227(3), pages 483-493.
  2. Kimms, A, 1998. "Stability Measures for Rolling Schedules with Applications to Capacity Expansion Planning, Master Production Scheduling, and Lot Sizing," Omega, Elsevier, vol. 26(3), pages 355-366, June.
  3. Jian Yang & Gang Yu, 2002. "On the Robust Single Machine Scheduling Problem," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 17-33, March.
  4. Choi, Byung-Cheon & Chung, Kwanghun, 2016. "Min–max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 252(2), pages 367-375.
  5. Vairaktarakis, George L., 2000. "Robust multi-item newsboy models with a budget constraint," International Journal of Production Economics, Elsevier, vol. 66(3), pages 213-226, July.
  6. M Ozlen & M Azizoğlu, 2011. "Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 152-164, January.
  7. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
  8. Adam Kasperski & Paweł Zieliński, 2019. "Risk-averse single machine scheduling: complexity and approximation," Journal of Scheduling, Springer, vol. 22(5), pages 567-580, October.
  9. Shabtay, Dvir & Gilenson, Miri, 2023. "A state-of-the-art survey on multi-scenario scheduling," European Journal of Operational Research, Elsevier, vol. 310(1), pages 3-23.
  10. Gaia Nicosia & Andrea Pacifici & Ulrich Pferschy & Julia Resch & Giovanni Righini, 2021. "Optimally rescheduling jobs with a Last-In-First-Out buffer," Journal of Scheduling, Springer, vol. 24(6), pages 663-680, December.
  11. 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.
  12. Xiong, Jian & Xing, Li-ning & Chen, Ying-wu, 2013. "Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns," International Journal of Production Economics, Elsevier, vol. 141(1), pages 112-126.
  13. Mina Roohnavazfar & Daniele Manerba & Lohic Fotio Tiotsop & Seyed Hamid Reza Pasandideh & Roberto Tadei, 2021. "Stochastic single machine scheduling problem as a multi-stage dynamic random decision process," Computational Management Science, Springer, vol. 18(3), pages 267-297, July.
  14. Kimms, Alf, 1996. "Stability measures for rolling schedules with applications to capacity expansion planning, master production scheduling, and lot sizing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 418, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  15. Siyun Zhang & Kameng Nip & Zhenbo Wang, 0. "Related machine scheduling with machine speeds satisfying linear constraints," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-17.
  16. Yin, Yunqiang & Luo, Zunhao & Wang, Dujuan & Cheng, T.C.E., 2023. "Wasserstein distance‐based distributionally robust parallel‐machine scheduling," Omega, Elsevier, vol. 120(C).
  17. Michele E. Pfund & John W. Fowler, 2017. "Extending the boundaries between scheduling and dispatching: hedging and rescheduling techniques," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3294-3307, June.
  18. Wang, Juite, 2004. "A fuzzy robust scheduling approach for product development projects," European Journal of Operational Research, Elsevier, vol. 152(1), pages 180-194, January.
  19. Cohen, Izack & Postek, Krzysztof & Shtern, Shimrit, 2023. "An adaptive robust optimization model for parallel machine scheduling," European Journal of Operational Research, Elsevier, vol. 306(1), pages 83-104.
  20. Averbakh, Igor, 2006. "The minmax regret permutation flow-shop problem with two jobs," European Journal of Operational Research, Elsevier, vol. 169(3), pages 761-766, March.
  21. Nicholas G. Hall & Chris N. Potts, 2004. "Rescheduling for New Orders," Operations Research, INFORMS, vol. 52(3), pages 440-453, June.
  22. Lin, Jun & Ng, Tsan Sheng, 2011. "Robust multi-market newsvendor models with interval demand data," European Journal of Operational Research, Elsevier, vol. 212(2), pages 361-373, July.
  23. Wipawee Tharmmaphornphilas & Bryan Norman, 2007. "A methodology to create robust job rotation schedules," Annals of Operations Research, Springer, vol. 155(1), pages 339-360, November.
  24. Thomas Schmitt & Bruce Faaland, 2004. "Scheduling recurrent construction," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(8), pages 1102-1128, December.
  25. Yuri N. Sotskov & Natalja G. Egorova, 2019. "The Optimality Region for a Single-Machine Scheduling Problem with Bounded Durations of the Jobs and the Total Completion Time Objective," Mathematics, MDPI, vol. 7(5), pages 1-21, April.
  26. Siyun Zhang & Kameng Nip & Zhenbo Wang, 2022. "Related machine scheduling with machine speeds satisfying linear constraints," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1724-1740, October.
  27. Tao, Liangyan & Liu, Sifeng & Xie, Naiming & Javed, Saad Ahmed, 2021. "Optimal position of supply chain delivery window with risk-averse suppliers: A CVaR optimization approach," International Journal of Production Economics, Elsevier, vol. 232(C).
  28. Semih Atakan & Kerem Bülbül & Nilay Noyan, 2017. "Minimizing value-at-risk in single-machine scheduling," Annals of Operations Research, Springer, vol. 248(1), pages 25-73, January.
  29. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.
  30. R. Montemanni & J. Barta & M. Mastrolilli & L. M. Gambardella, 2007. "The Robust Traveling Salesman Problem with Interval Data," Transportation Science, INFORMS, vol. 41(3), pages 366-381, August.
  31. Igor Averbakh & Oded Berman, 2000. "Minmax Regret Median Location on a Network Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 104-110, May.
  32. Cao, Qidong & Patterson, J. Wayne & Bai, Xue, 2005. "Reexamination of processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 164(1), pages 185-194, July.
  33. Chang, Zhiqi & Ding, Jian-Ya & Song, Shiji, 2019. "Distributionally robust scheduling on parallel machines under moment uncertainty," European Journal of Operational Research, Elsevier, vol. 272(3), pages 832-846.
  34. Carlo Meloni & Marco Pranzo, 2020. "Expected shortfall for the makespan in activity networks under imperfect information," Flexible Services and Manufacturing Journal, Springer, vol. 32(3), pages 668-692, September.
  35. Briskorn, Dirk & Leung, Joseph & Pinedo, Michael, 2008. "Robust scheduling on a single machine usinge time buffers," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 639, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  36. Mausser, Helmut E. & Laguna, Manuel, 1999. "A heuristic to minimax absolute regret for linear programs with interval objective function coefficients," European Journal of Operational Research, Elsevier, vol. 117(1), pages 157-174, August.
  37. An, Jaehyung & Mikhaylov, Alexey & Jung, Sang-Uk, 2021. "A Linear Programming approach for robust network revenue management in the airline industry," Journal of Air Transport Management, Elsevier, vol. 91(C).
  38. Yuri N. Sotskov & Natalja M. Matsveichuk & Vadzim D. Hatsura, 2020. "Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times," Mathematics, MDPI, vol. 8(8), pages 1-51, August.
  39. Dmitry Ivanov & Alexandre Dolgui & Boris Sokolov & Frank Werner, 2016. "Schedule robustness analysis with the help of attainable sets in continuous flow problem under capacity disruptions," International Journal of Production Research, Taylor & Francis Journals, vol. 54(11), pages 3397-3413, June.
  40. Al-Hinai, Nasr & ElMekkawy, T.Y., 2011. "Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm," International Journal of Production Economics, Elsevier, vol. 132(2), pages 279-291, August.
  41. Subhash C. Sarin & Balaji Nagarajan & Sanjay Jain & Lingrui Liao, 2009. "Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability," Journal of Combinatorial Optimization, Springer, vol. 17(4), pages 400-416, May.
  42. Aytug, Haldun & Lawley, Mark A. & McKay, Kenneth & Mohan, Shantha & Uzsoy, Reha, 2005. "Executing production schedules in the face of uncertainties: A review and some future directions," European Journal of Operational Research, Elsevier, vol. 161(1), pages 86-110, February.
  43. Cowling, Peter & Johansson, Marcus, 2002. "Using real time information for effective dynamic scheduling," European Journal of Operational Research, Elsevier, vol. 139(2), pages 230-244, June.
  44. Abdelhamid Boudjelida, 2019. "On the robustness of joint production and maintenance scheduling in presence of uncertainties," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1515-1530, April.
  45. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
  46. Silva, Marco & Poss, Michael & Maculan, Nelson, 2020. "Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 283(1), pages 70-82.
  47. Yuli Zhang & Zuo-Jun Max Shen & Shiji Song, 2018. "Exact Algorithms for Distributionally β -Robust Machine Scheduling with Uncertain Processing Times," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 662-676, November.
  48. Lu, Haimin & Pei, Zhi, 2023. "Single machine scheduling with release dates: A distributionally robust approach," European Journal of Operational Research, Elsevier, vol. 308(1), pages 19-37.
  49. Lung-Yu Li & Jian-You Xu & Shuenn-Ren Cheng & Xingong Zhang & Win-Chin Lin & Jia-Cheng Lin & Zong-Lin Wu & Chin-Chia Wu, 2022. "A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment," Mathematics, MDPI, vol. 10(21), pages 1-22, November.
  50. Gang Xuan & Win-Chin Lin & Shuenn-Ren Cheng & Wei-Lun Shen & Po-An Pan & Chih-Ling Kuo & Chin-Chia Wu, 2022. "A Robust Single-Machine Scheduling Problem with Two Job Parameter Scenarios," Mathematics, MDPI, vol. 10(13), pages 1-17, June.
  51. Pei, Zhi & Lu, Haimin & Jin, Qingwei & Zhang, Lianmin, 2022. "Target-based distributionally robust optimization for single machine scheduling," European Journal of Operational Research, Elsevier, vol. 299(2), pages 420-431.
  52. Kasperski, Adam & Kurpisz, Adam & Zieliński, Paweł, 2012. "Approximating a two-machine flow shop scheduling under discrete scenario uncertainty," European Journal of Operational Research, Elsevier, vol. 217(1), pages 36-43.
  53. Chin-Chia Wu & Jatinder N. D. Gupta & Win-Chin Lin & Shuenn-Ren Cheng & Yen-Lin Chiu & Juin-Han Chen & Long-Yuan Lee, 2022. "Robust Scheduling of Two-Agent Customer Orders with Scenario-Dependent Component Processing Times and Release Dates," Mathematics, MDPI, vol. 10(9), pages 1-17, May.
  54. 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.
  55. Conde, Eduardo, 2012. "On a constant factor approximation for minmax regret problems using a symmetry point scenario," European Journal of Operational Research, Elsevier, vol. 219(2), pages 452-457.
  56. Şeker, Merve & Noyan, Nilay, 2012. "Stochastic optimization models for the airport gate assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 438-459.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.