IDEAS home Printed from https://ideas.repec.org/p/osf/osfxxx/523zs.html

From Bureaucratic Organization to Team of Teams: A Case Study from The Provincial Government of West Java

Author

Listed:
  • Hadi, Nugroho Atma
  • Ginting, Henndy
  • Sushandoyo, Dedy

Abstract

To face increasingly complex challenges and environments, public organizations are transforming from being bureaucratic and rigid to being more agile. Researchers have not widely discussed the agility of public organizations in the context of Team of Teams. This study reveals how the practice of implementing Team of Teams in public organizations in the Indonesian context. The findings show that public organizations with a Team of Teams approach emphasize more on the formation and collaboration of competency-based groups. These findings provide insight for other public organizations to implement the Team of Teams approach.

Suggested Citation

  • Hadi, Nugroho Atma & Ginting, Henndy & Sushandoyo, Dedy, 2024. "From Bureaucratic Organization to Team of Teams: A Case Study from The Provincial Government of West Java," OSF Preprints 523zs, Center for Open Science.
    • Handle: RePEc:osf:osfxxx:523zs
    DOI: 10.31219/osf.io/523zs
    as

    Download full text from publisher

    File URL: https://osf.io/download/67653c416bfb4752e4e4aebf/
    Download Restriction: no
    File URL: https://libkey.io/10.31219/osf.io/523zs?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
    ---><---

    References listed on IDEAS

    as
    1. Zamorano, Emilio & Stolletz, Raik, 2017. "Branch-and-price approaches for the Multiperiod Technician Routing and Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 55-68.
    2. Myriam Guillaume & Sabrina Loufrani-Fedida, 2023. "Stakeholder engagement in inclusive employability management for employees whose health at work is impaired: Empirical evidence from a French public organisation," Post-Print halshs-03547943, HAL.
    Full references (including those not matched with items on IDEAS)

    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. repec:osf:osfxxx:523zs_v1 is not listed on IDEAS
    2. Rapeepan Pitakaso & Kanchana Sethanan & Ajay Kumar & Kim Hua Tan & Natthapong Nanthasamroeng, 2026. "An application of artificial intelligence for solving multi-visit scheduling and routing of multi-heterogeneous resources," Annals of Operations Research, Springer, vol. 359(2), pages 1771-1820, April.
    3. Avraham, Edison & Raviv, Tal & Khmelnitsky, Eugene, 2017. "The decentralized field service routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 290-316.
    4. Giacomo Dall’Olio & Rainer Kolisch, 2023. "Formation and Routing of Worker Teams for Airport Ground Handling Operations: A Branch-and-Price-and-Check Approach," Transportation Science, INFORMS, vol. 57(5), pages 1231-1251, September.
    5. Song, Yujian & Zhang, Jiantong & Liang, Zhe & Ye, Chunming, 2017. "An exact algorithm for the container drayage problem under a separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 231-254.
    6. Qie He & Stefan Irnich & Yongjia Song, 2018. "Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Working Papers 1804, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    7. Jean-François Cordeau & Manuel Iori & Dario Vezzali, 2024. "An updated survey of attended home delivery and service problems with a focus on applications," Annals of Operations Research, Springer, vol. 343(2), pages 885-922, December.
    8. Qie He & Stefan Irnich & Yongjia Song, 2019. "Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Transportation Science, INFORMS, vol. 53(5), pages 1409-1426, September.
    9. Annear, Luis Mauricio & Akhavan-Tabatabaei, Raha & Schmid, Verena, 2023. "Dynamic assignment of a multi-skilled workforce in job shops: An approximate dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1109-1125.
    10. Marlin Ulmer & Martin Savelsbergh, 2020. "Workforce Scheduling in the Era of Crowdsourced Delivery," Transportation Science, INFORMS, vol. 54(4), pages 1113-1133, July.
    11. Neda Tanoumand & Tonguç Ünlüyurt, 2021. "An exact algorithm for the resource constrained home health care vehicle routing problem," Annals of Operations Research, Springer, vol. 304(1), pages 397-425, September.
    12. Guastaroba, G. & Côté, J.-F. & Coelho, L.C., 2021. "The Multi-Period Workforce Scheduling and Routing Problem," Omega, Elsevier, vol. 102(C).
    13. Si, Guojin & Xia, Tangbin & Li, Yaping & Wang, Dong & Chen, Zhen & Pan, Ershun & Xi, Lifeng, 2023. "Resource allocation and maintenance scheduling for distributed multi-center renewable energy systems considering dynamic scope division," Renewable Energy, Elsevier, vol. 217(C).
    14. Vincent F. Yu & Yueh-Sheng Lin & Panca Jodiawan & Shih-Wei Lin & Yu-Chi Lai, 2023. "The Field Technician Scheduling Problem with Experience-Dependent Service Times," Mathematics, MDPI, vol. 11(21), pages 1-17, November.
    15. Si, Guojin & Xia, Tangbin & Zhu, Ying & Du, Shichang & Xi, Lifeng, 2019. "Triple-level opportunistic maintenance policy for leasehold service network of multi-location production lines," Reliability Engineering and System Safety, Elsevier, vol. 190(C), pages 1-1.
    16. Fangzhou Yan & Huaxin Qiu & Dongya Han, 2023. "Lagrangian Heuristic for Multi-Depot Technician Planning of Product Distribution and Installation with a Lunch Break," Mathematics, MDPI, vol. 11(3), pages 1-22, January.
    17. Emilio Zamorano & Annika Becker & Raik Stolletz, 2018. "Task assignment with start time-dependent processing times for personnel at check-in counters," Journal of Scheduling, Springer, vol. 21(1), pages 93-109, February.
    18. Voravee Punyakum & Kanchana Sethanan & Krisanarach Nitisiri & Rapeepan Pitakaso, 2022. "Hybrid Particle Swarm and Whale Optimization Algorithm for Multi-Visit and Multi-Period Dynamic Workforce Scheduling and Routing Problems," Mathematics, MDPI, vol. 10(19), pages 1-20, October.
    19. Jean-François Cordeau & Manuel Iori & Dario Vezzali, 2023. "A survey of attended home delivery and service problems with a focus on applications," 4OR, Springer, vol. 21(4), pages 547-583, December.
    20. Nowak, Maciek & Szufel, Przemysław, 2024. "Technician routing and scheduling for the sharing economy," European Journal of Operational Research, Elsevier, vol. 314(1), pages 15-31.
    21. Agnieszka Raczek & Anna Dewalska-Opitek & Ewa Kraus & Agnieszka Szostak & Dawid Zebrak, 2025. "Labour Market Inclusiveness as a Key Challenge Facing Society and Management," European Research Studies Journal, European Research Studies Journal, vol. 0(3), pages 283-301.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:osf:osfxxx:523zs. 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: OSF (email available below). General contact details of provider: https://osf.io/preprints/ .

    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.