Coordination of the decentralized concurrent open-shop

References

• Ahmadian, M.M., Khatami, M., Salehipour, A. and Cheng, T.C.E. (2021) Four decades of research on the open-shop scheduling problem to minimize the makespan. European Journal of Operational Research, 295(2), 399–426.
   Web of Science ®Google Scholar
• Anand, E. and Panneerselvam, R. (2015) Literature review of open shop scheduling problems. Intelligent Information Management, 7, 33–52.
   Google Scholar
• Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, É., Wexler, T. and Roughgarden, T. (2008) The price of stability for network design with fair cost allocation. SIAM Journal on Computing, 38(4), 1602–1623.
   Web of Science ®Google Scholar
• Atay, A., Calleja, P. and Soteras, S. (2021) Open shop scheduling games. European Journal of Operational Research,295(1), 12–21.
   Web of Science ®Google Scholar
• Aydinliyim, T. and Vairaktarakis, G.L. (2011) Sequencing strategies and coordination issues in outsourcing and subcontracting operations, in Planning Production and Inventories in the Extended Enterprise, International Series in Operations Research & Management Science, 151, pp. 269–319.
   Google Scholar
• Bukchin, Y. and Hanany, E. (2007) Decentralization cost in scheduling: A game-theoretic approach. Manufacturing & Service Operations Management, 9(3), 263–275.
   Web of Science ®Google Scholar
• Bukchin, Y. and Hanany, E. (2020) Decentralization cost in two-machine job-shop scheduling with minimum flow-time objective. IISE Transactions, 52(12), 1386–1402.
   Web of Science ®Google Scholar
• Chen, Z-L. and Hall, N.G. (2007). Supply chain scheduling: Conflicts and cooperation in assembly systems. Operations Research, 55, 1072–1089
   Web of Science ®Google Scholar
• Dayanand, N. and Padman, R. (2001) A two stage search heuristic for scheduling payments in projects. Annals of Operations Research, 102, 197–220.
   Web of Science ®Google Scholar
• Framinan, J.M., Perez-Gonzalez, P. and Fernandez-Viagas, V. (2019) Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. European Journal of Operational Research, 273, 401–417.
   Web of Science ®Google Scholar
• Grinold, R.C. (1972) The payment scheduling problem. Naval Research Logistics Quarterly, 19(1), 123–126.
   Google Scholar
• Hall, N.G. and Liu, Z. (2008) Cooperative and noncooperative games for capacity planning and scheduling, in State-of-the-Art Decision-Making Tools in the Information-Intensive Age, pp. 108–129, Informs.
   Google Scholar
• Hall, N.G. and Potts, C.N. (2003) Supply chain scheduling: batching and delivery. Operations Research, 51, 566–584.
   Web of Science ®Google Scholar
• Hamers, H. Klijn, F. and Slikker, M. (2019) Implementation of optimal schedules in outsourcing with identical suppliers. Mathematical Methods of Operations Research, 89(2), 173–187.
   Web of Science ®Google Scholar
• Koutsoupias, E. and Papadimitriou, C. (1999) Worst-case equilibria, in STACS 1999, 16th Annual Symposium on Theoretical Aspects of Computer Science, published as Lecture Notes in Computer Science, 1563, Springer, Berlin, Germany, pp. 404–413.
   Google Scholar
• Kress, D., Meiswinkel, S. and Pesch, E. (2018) Mechanism design for machine scheduling problems: Classification and literature overview. OR Spectrum, 40(3), 583–611.
   Web of Science ®Google Scholar
• Leung, J.Y-T., Li, H. and Pinedo, M. (2005) Order scheduling in an environment with dedicated resources in parallel. Journal of Scheduling, 8, 355–386.
   Web of Science ®Google Scholar
• Manoj, U.V., Sriskandarajah, C. and Wagneur, E. (2012) Coordination in a two-stage production system: complexity, conflict and cooperation. Computers and Operations Research, 39(6), 1245–1256.
   Web of Science ®Google Scholar
• Mastrolilli, M., Queyranne, M., Schulz, A.S., Svensson, O. and Uhan, N.A. (2010) Minimizing the sum of weighted completion times in a concurrent open shop. Operations Research Letters, 38(5), 390–395.
   Web of Science ®Google Scholar
• Nash, J.F. (1951) Non-cooperative games. Annals of Mathematics, 54, 286–295.
   Web of Science ®Google Scholar
• Pinedo, M. (2016) Scheduling: Theory, Algorithms, and Systems. 5th Ed., Springer, New-York, NY.
   Google Scholar
• Roemer, T.A. (2006) A note on the complexity of the concurrent open shop problem. Journal of Scheduling, 9(4), 389–396.
   Web of Science ®Google Scholar
• Russell, A.H. (1970) Cash flow in networks. Management Science, 16(5), 357–373.
   Web of Science ®Google Scholar
• Selvarajah E. and Steiner, G. (2009) Approximation algorithms for the supplier’s supply chain scheduling problem to minimize delivery and inventory holding costs. Operations Research, 57(2), 426–432
   Web of Science ®Google Scholar
• Vairaktarakis, G.L. (2013) Noncooperative games for subcontracting operations. Manufacturing and Service Operations Management, 15(1), 148–158.
   Web of Science ®Google Scholar
• Vairaktarakis, G.L. and Aydinliyim, T. (2017) Benchmark schedules for subcontracted operations: decentralization inefficiencies that arise from competition and first-come-first-served processing. Decision Sciences, 48(4), 657–690.
   Web of Science ®Google Scholar
• Wagneur, E. and Sriskandarajah, C. (1993) Open shop with jobs overlap. European Journal of Operational Research, 71(3), 366–378.
   Google Scholar
• Yoon, S.H. and Sung, C.E. (2004) Fixed pre-assembly scheduling on multiple fabrication machines. International Journal of Production Economics, 96, 109–118.
   Web of Science ®Google Scholar
• Zhao, Y. (2013) Why 787 slips were inevitable? http://zhao.rutgers.edu/Project-PDSCs.htm (accessed 18 February 2014).
   Google Scholar