- Ahmad, N.B.; Barakji, S.A.R.; Abou Shahada, T.M.; Anabtawi, Z.A. How to launch a successful video game: A framework. Entertain. Comput. 2017, 23, 1â11. [CrossRef]
Paper not yet in RePEc: Add citation now
- Ahmad, S.; Khan, Z.A.; Ali, M.; Asjad, M. Geometric and Harmonic means based priority dispatching rules for single machine scheduling problems. Int. J. Prod. Manag. Eng. 2021, 9, 93â102. [CrossRef]
Paper not yet in RePEc: Add citation now
- Ahmed, S. Naughty Dog Discusses Being Acquired by Sony. GameSpot. 2006. Available online: https://www.gamespot.com/ articles/naughty-dog-discusses-being-acquired-by-sony/1100-2677654/ (accessed on 1 March 2022).
Paper not yet in RePEc: Add citation now
Anderson, E.G.; Parker, G.G.; Tan, B. Platform performance investment in the presence of network externalities. Inf. Syst. Res. 2014, 25, 152â172. [CrossRef]
- Androvich, M. GTA IV: Most expensive game ever developed? Games Industry International, 30 April 2008.
Paper not yet in RePEc: Add citation now
- Arik, O.A.; Schutten, M.; Topan, E. Weighted earliness/tardiness parallel machine scheduling problem with a common due date. Expert Syst. Appl. 2022, 187, 115916. [CrossRef]
Paper not yet in RePEc: Add citation now
- Bailey, E.; Miyata, K. Improving video game project scope decisions with data: An analysis of achievements and game completion rates. Entertain. Comput. 2019, 31, 100299. [CrossRef]
Paper not yet in RePEc: Add citation now
- Bajestani, M.A.; Moghaddam, R.T. A new branch-and-bound algorithm for the unrelated parallel machine scheduling problem with sequence-dependent setup times. IFAC Proc. Vol. 2009, 42, 792â797. [CrossRef]
Paper not yet in RePEc: Add citation now
- Bethke, E. Game Development and Production; Wordware Publishing, Inc.: Plano, TX, USA, 2003.
Paper not yet in RePEc: Add citation now
- Bianchessi, N.; Tresoldi, E. A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts. Comput. Oper. Res. 2021, 136, 105464. [CrossRef]
Paper not yet in RePEc: Add citation now
- Cheng, C.Y.; Huang, L.W. Minimizing total earliness and tardiness through unrelated parallel machine scheduling using distributed release time control. J. Manuf. Syst. 2017, 42, 1â10. [CrossRef]
Paper not yet in RePEc: Add citation now
Chou, F.D. Minimising the total weighted tardiness for non-identical parallel batch processing machines with job release times and non-identical job sizes. Eur. J. Ind. Eng. 2013, 7, 529â557. [CrossRef]
Chu, C.B. A branch-and-bound algorithm to minimize total tardiness with different release dates. Nav. Res. Logist. 1992, 39, 265â283. [CrossRef]
Costa, L.H.M.; Prata, B.D.; Ramos, H.M.; de Castro, M.A.H. A branch-and-bound algorithm for optimal pump scheduling in water distribution networks. Water Resour. Manag. 2016, 30, 1037â1052. [CrossRef]
- Danaci, T.; Toksari, D. A branch-and-bound algorithm for two-competing-agent single-machine scheduling problem with jobs under simultaneous effects of learning and deterioration to minimize total weighted completion time with no-tardy jobs. Int. J. Ind. Eng. 2021, 28, 577â593.
Paper not yet in RePEc: Add citation now
- Della Croce, F.; Tadei, R.; Baracco, P.; Grosso, A. A new decomposition approach for the single machine total tardiness scheduling problem. J. Oper. Res. Soc. 1998, 49, 1101â1106. [CrossRef]
Paper not yet in RePEc: Add citation now
- Diana, R.O.M.; de Souza, S.R. Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines. Comput. Oper. Res. 2020, 117, 104886. [CrossRef]
Paper not yet in RePEc: Add citation now
- Duffy, J. The Game Industry Salary Survey 2007. GameCareerGuide. 2007. Available online: https://www.gamecareerguide. com/features/416/the_game_industry_salary_survey_.php (accessed on 1 March 2022).
Paper not yet in RePEc: Add citation now
- East, R. So, You Want to Be a Game Developer? Medium. 2019. Available online: https://medium.com/swlh/so-you-want-tobe -a-game-developer-e3b7f9f4ac70 (accessed on 1 March 2022).
Paper not yet in RePEc: Add citation now
- Fritz, B. Video game borrows page from Hollywood playbook. Los Angeles Times, 18 November 2009.
Paper not yet in RePEc: Add citation now
- Fritz, B.; Pham, A. Star Wars: The old republicâThe story behind a galactic gamble. Los Angeles Times, 20 January 2012.
Paper not yet in RePEc: Add citation now
- Gao, J.S.; Zhu, X.M.; Zhang, R.T. A branch-and-price approach to the multitasking scheduling with batch control on parallel machines. Int. Trans. Oper. Res. 2022. [CrossRef]
Paper not yet in RePEc: Add citation now
Ghirardi, M.; Potts, C.N. Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. Eur. J. Oper. Res. 2005, 165, 457â467. [CrossRef]
Gretz, R.T. Hardware quality vs. network size in the home video game industry. J. Econ. Behav. Organ. 2010, 76, 168â183. [CrossRef]
Harada, N. Video game demand in Japan: A household data analysis. Appl. Econ. 2007, 39, 1705â1710. [CrossRef]
- Hodge, V.J.; Sephton, N.; Devlin, S.; Cowling, P.I.; Goumagias, N.; Shao, J.H.; Purvis, K.; Cabras, I.; Fernandes, K.J.; Li, F. How the business model of customizable card games influences player engagement. IEEE Trans. Games 2019, 11, 374â385. [CrossRef]
Paper not yet in RePEc: Add citation now
- Hulett, M.; Damodaran, P.; Amouie, M. Scheduling non-identical parallel batch processing machines to minimize total weighted tardiness using particle swarm optimization. Comput. Ind. Eng. 2017, 113, 425â436. [CrossRef]
Paper not yet in RePEc: Add citation now
- Irwin, M.J. Indie game developers rise up. Forbes, 20 November 2008.
Paper not yet in RePEc: Add citation now
Kacem, I.; Chu, C.B. Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint. Int. J. Prod. Econ. 2008, 112, 138â150. [CrossRef] Mathematics 2022, 10, 1200 24 of 24
- Khoudi, A.; Berrichi, A. Branch and bound algorithm for identical parallel machine scheduling problem to maximise system availability. Int. J. Manuf. Res. 2020, 15, 199â217. [CrossRef]
Paper not yet in RePEc: Add citation now
Khoudi, A.; Berrichi, A. Minimize total tardiness and machine unavailability on single machine scheduling problem: Bi-objective branch and bound algorithm. Oper. Res. 2020, 20, 1763â1789. [CrossRef]
- Kolakowski, N. Game Developer Salary: Maximum, Minimum, and Career Downsides. Dice. 2018. Available online: https: //insights.dice.com/2018/05/11/game-developer-salary-maximum-minimum-career-downsides/ (accessed on 1 March 2022).
Paper not yet in RePEc: Add citation now
- Kozlowski, E.; Mazurkiewicz, D.; Zabinski, T.; Prucnal, S.; Sep, J. Machining sensor data management for operation-level predictive model. Expert Syst. Appl. 2020, 159, 113600. [CrossRef]
Paper not yet in RePEc: Add citation now
- Kumar, H.; Tyagi, I. Hybrid model for tasks scheduling in distributed real time system. J. Ambient Intell. Humaniz. Comput. 2021, 12, 2881â2903. [CrossRef]
Paper not yet in RePEc: Add citation now
Lee, C.H. A dispatching rule and a random iterated greedy metaheuristic for identical parallel machine scheduling to minimize total tardiness. Int. J. Prod. Res. 2018, 56, 2292â2308. [CrossRef]
Lee, J.Y.; Kim, Y.D. A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint. J. Oper. Res. Soc. 2015, 66, 1542â1554. [CrossRef]
Lee, W.C.; Wang, J.Y.; Lee, L.Y. A hybrid genetic algorithm for an identical parallel-machine problem with maintenance activity. J. Oper. Res. Soc. 2015, 66, 1906â1918. [CrossRef]
- Lee, W.C.; Wang, J.Y.; Lin, M.C. A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents. Knowl.-Based Syst. 2016, 105, 68â82. [CrossRef]
Paper not yet in RePEc: Add citation now
- Liang, T.K.; Zeng, B.; Liu, J.Q.; Ye, L.F.; Zou, C.F. An unsupervised user behavior prediction algorithm based on machine learning and neural network for smart home. IEEE Access 2018, 6, 49237â49247. [CrossRef]
Paper not yet in RePEc: Add citation now
- Lin, F.P.C.; Phoa, F.K.H. Runtime estimation and scheduling on parallel processing supercomputers via instance-based learning and swarm intelligence. Int. J. Mach. Learn. Comput. 2019, 9, 592â598. [CrossRef]
Paper not yet in RePEc: Add citation now
- Liu, L.L.; Ng, C.T.; Cheng, T.C.E. Scheduling jobs with agreeable processing times and due dates on a single batch processing machine. Theor. Comput. Sci. 2007, 374, 159â169. [CrossRef]
Paper not yet in RePEc: Add citation now
- Lu, G.X. New lower bounds for arithmetic, geometric, harmonic mean inequalities and entropy upper bound. Math. Inequalities Appl. 2017, 20, 1041â1050.
Paper not yet in RePEc: Add citation now
Mensendiek, A.; Gupta, J.N.D.; Herrmann, J. Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness. Eur. J. Oper. Res. 2015, 243, 514â522. [CrossRef]
- Moore, M.E.; Novak, J. Game Development Essentials: Game Industry Career Guide; Cengage Learning: Boston, MA, USA, 2010.
Paper not yet in RePEc: Add citation now
- Motair, H.M. Exact and hybrid metaheuristic algorithms to solve bi-objective permutation flow shop scheduling problem. J. Phys. Conf. Ser. 2021, 1818, 012042. [CrossRef]
Paper not yet in RePEc: Add citation now
Nessah, R.; Kacem, I. Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. Comput. Oper. Res. 2012, 39, 471â478. [CrossRef]
Nessah, R.; Yalaoui, F.; Chu, C.B. A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates. Comput. Oper. Res. 2008, 35, 1176â1190. [CrossRef]
Ozturk, O.; Begen, M.A.; Zaric, G.S. A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan. Int. J. Prod. Res. 2017, 55, 1815â1831. [CrossRef]
Pei, Z.; Wan, M.Z.; Wang, Z.T. A new approximation algorithm for unrelated parallel machine scheduling with release dates. Ann. Oper. Res. 2020, 285, 397â425. [CrossRef]
- PMI. A Guide to the Project Management Body of Knowledge, 6th ed.; Project Management Institute, Inc.: Newtown Square, PA, USA, 2017.
Paper not yet in RePEc: Add citation now
- Quora. Why Have Video Game Budgets Skyrocketed in Recent Years? Quora. 2016. Available online: https://www. forbes.com/sites/quora/2016/10/31/why-have-video-game-budgets-skyrocketed-in-recent-years/#6db6aaf93ea5 (accessed on 1 March 2022).
Paper not yet in RePEc: Add citation now
- Schaller, J.; Valente, J. Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed. Comput. Oper. Res. 2019, 109, 1â11. [CrossRef]
Paper not yet in RePEc: Add citation now
- Schaller, J.E. Minimizing total tardiness for scheduling identical parallel machines with family setups. Comput. Ind. Eng. 2014, 72, 274â281. [CrossRef]
Paper not yet in RePEc: Add citation now
- Senapati, D.; Sarkar, A.; Karfa, C. Performance-effective DAG scheduling for heterogeneous distributed systems. In Proceedings of the ICDCN 2022: 23rd International Conference on Distributed Computing and Networking, Delhi, India, 4â7 January 2022.
Paper not yet in RePEc: Add citation now
Shim, S.O.; Kim, Y.D. Minimizing total tardiness in an unrelated parallel-machine scheduling problem. J. Oper. Res. Soc. 2007, 58, 346â354. [CrossRef]
- Shobaki, G.; Bassett, J.; Heffernan, M.; Kerbow, A. Graph transformations for register-pressure-aware instruction scheduling. In Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction, Seoul, Korea, 2â3 April 2022.
Paper not yet in RePEc: Add citation now
- Smith, C. The Most Expensive Video Games Ever Created. KnowTechie. 2018. Available online: https://knowtechie.com/themost -expensive-video-games-ever-created/ (accessed on 1 March 2022). Mathematics 2022, 10, 1200 23 of 24
Paper not yet in RePEc: Add citation now
- Srinivasan, A.; Venkatraman, N. Indirect network effects and platform dominance in the video game industry: A network perspective. IEEE Trans. Eng. Manag. 2010, 57, 661â673. [CrossRef]
Paper not yet in RePEc: Add citation now
Tanaka, S.; Araki, M. A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines. Int. J. Prod. Econ. 2008, 113, 446â458. [CrossRef]
- Thenarasu, M.; Rameshkumar, K.; Rousseau, J.; Anbuudayasankar, S.P. Development and analysis of priority decision rules using MCDM approach for a flexible job shop scheduling: A simulation study. Simul. Model. Pract. Theory 2022, 114, 102416. [CrossRef]
Paper not yet in RePEc: Add citation now
- Toksari, M.D. A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs. Comput. Oper. Res. 2011, 38, 1361â1365. [CrossRef]
Paper not yet in RePEc: Add citation now
- Ultimatepopculture. List of Highest-Grossing Video Game Franchises. Ultimate Pop Culture Wiki. 2022. Available online: https:// ultimatepopculture.fandom.com/wiki/List_of_highest-grossing_video_game_franchises#cite_note-6 (accessed on 1 March 2022).
Paper not yet in RePEc: Add citation now
- Vogel, H.L. Entertainment Industry Economics: A Guide for Financial Analysis; Cambridge University Press: Cambridge, UK, 2014.
Paper not yet in RePEc: Add citation now
- Voutsinas, T.G.; Pappis, C.P. A branch and bound algorithm for single machine scheduling with deteriorating values of jobs. Math. Comput. Model. 2010, 52, 55â61. [CrossRef]
Paper not yet in RePEc: Add citation now
- Wang, J.Y. A branch-and-bound algorithm for minimizing the total tardiness of a three-agent scheduling problem considering the overlap effect and environment protection. IEEE Access 2019, 7, 5106â5123. [CrossRef]
Paper not yet in RePEc: Add citation now
- Wang, J.Y. Algorithms for minimizing resource consumption over multiple machines with a common due window. IEEE Access 2019, 7, 172136â172151. [CrossRef]
Paper not yet in RePEc: Add citation now
Wang, J.Y. Minimizing the total weighted tardiness of overlapping jobs on parallel machines with a learning effect. J. Oper. Res. Soc. 2020, 71, 910â927. [CrossRef]
- Wang, J.Y.; Jea, K.F. A near-optimal database allocation for reducing the average waiting time in the grid computing environment. Inf. Sci. 2009, 179, 3772â3790. [CrossRef]
Paper not yet in RePEc: Add citation now
- Wang, S.J.; Liu, M. A branch and bound algorithm for single-machine production scheduling integrated with preventive maintenance planning. Int. J. Prod. Res. 2013, 51, 847â868. [CrossRef]
Paper not yet in RePEc: Add citation now
- Wang, X.; Ren, T.; Bai, D.; Ezeh, C.; Zhang, H.; Dong, Z. Minimizing the sum of makespan on multi-agent single-machine scheduling with release dates. Swarm Evol. Comput. 2022, 69, 100996. [CrossRef]
Paper not yet in RePEc: Add citation now
- Wang, X.M.; Li, Z.T.; Chen, Q.X.; Mao, N. Meta-heuristics for unrelated parallel machines scheduling with random rework to minimize expected total weighted tardiness. Comput. Ind. Eng. 2020, 145, 106505. [CrossRef]
Paper not yet in RePEc: Add citation now
- Wikipedia. List of Most Expensive Video Games to Develop. Wikipedia. 2022. Available online: https://en.wikipedia.org/wiki/ List_of_most_expensive_video_games_to_develop (accessed on 1 March 2022).
Paper not yet in RePEc: Add citation now
- Yao, S.Q.; Jiang, Z.B.; Li, N. A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals. Comput. Oper. Res. 2012, 39, 939â951. [CrossRef]
Paper not yet in RePEc: Add citation now
- Yin, Y.Q.; Wu, W.H.; Wu, W.H.; Wu, C.C. A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects. Inf. Sci. 2014, 256, 91â108. [CrossRef]
Paper not yet in RePEc: Add citation now
- Yu, F.; Wen, P.H.; Yi, S.P. A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan. Adv. Mech. Eng. 2018, 10, 1687814018756103. [CrossRef]
Paper not yet in RePEc: Add citation now
- Zhao, Y.P.; Xu, X.Y.; Xu, E.D.; Niu, B. Stochastic customer order scheduling on heterogeneous parallel machines with resource allocation consideration. Comput. Ind. Eng. 2021, 160, 107539. [CrossRef]
Paper not yet in RePEc: Add citation now