IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v161y2008i1p87-10210.1007-s10479-007-0302-1.html
   My bibliography  Save this article

Forming partnerships in a virtual factory

Author

Listed:
  • George Vairaktarakis
  • Jamshid Hosseini

Abstract

In the evolving paradigm known as ‘agile operations’, conceptual and visionary descriptions are progressively becoming abundant. Rigorous treatments leading to operable solutions, on the other hand, are scarce and in need of development. Formation of partnerships ranging from rudimentary supplier type relationships to strategic alliances comprise an aspect of agile operations called the ‘virtual factory’ in the new paradigm. We develop a model to determine an optimal alliance of partners for executing a given project composed of a set of activities and their precedence network. Possible alliances amongst partners are given in a ‘partnership matrix’, induced by a set of operating characteristics for each partner. Using the above information we formulate the problem of assigning project activities to eligible partners so that every pair of adjacent activities is assigned to a pair of compatible (or allied) partners. Our objective is to minimize the project duration. Lower bounds and heuristic algorithms are developed for the above problem, that take advantage of a mathematical formulation and the structure of the problem. Supporting computational experiments are also reported. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • George Vairaktarakis & Jamshid Hosseini, 2008. "Forming partnerships in a virtual factory," Annals of Operations Research, Springer, vol. 161(1), pages 87-102, July.
    • Handle: RePEc:spr:annopr:v:161:y:2008:i:1:p:87-102:10.1007/s10479-007-0302-1
    DOI: 10.1007/s10479-007-0302-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0302-1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0302-1?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Nicholas G. Hall & Marc E. Posner, 2001. "Generating Experimental Data for Computational Testing with Machine Scheduling Applications," Operations Research, INFORMS, vol. 49(6), pages 854-865, December.
    2. George L. Vairaktarakis, 2003. "The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem," Management Science, INFORMS, vol. 49(6), pages 718-732, June.
    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. Lin, B.M.T. & Liu, S.T., 2008. "Maximizing the reward in the relocation problem with generalized due dates," International Journal of Production Economics, Elsevier, vol. 115(1), pages 55-63, September.
    2. Wang, Xiong & Ferreira, Fernando A.F. & Chang, Ching-Ter, 2022. "Multi-objective competency-based approach to project scheduling and staff assignment: Case study of an internal audit project," Socio-Economic Planning Sciences, Elsevier, vol. 81(C).
    3. Zhi-Long Chen & Nicholas G. Hall, 2010. "The Coordination of Pricing and Scheduling Decisions," Manufacturing & Service Operations Management, INFORMS, vol. 12(1), pages 77-92, April.
    4. Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang, 2021. "Robust Capacity Planning for Project Management," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1533-1550, October.
    5. Sobel, Matthew J. & Szmerekovsky, Joseph G. & Tilson, Vera, 2009. "Scheduling projects with stochastic activity duration to maximize expected net present value," European Journal of Operational Research, Elsevier, vol. 198(3), pages 697-705, November.
    6. Wenhui Zhao & Nicholas G. Hall & Zhixin Liu, 2020. "Project Evaluation and Selection with Task Failures," Production and Operations Management, Production and Operations Management Society, vol. 29(2), pages 428-446, February.
    7. Hartmann, Sönke, 2002. "Generating scenarios for simulation and optimization of container terminal logistics," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 564, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Allahverdi, Ali & Aydilek, Harun, 2014. "Total completion time with makespan constraint in no-wait flowshops with setup times," European Journal of Operational Research, Elsevier, vol. 238(3), pages 724-734.
    9. Choi, Byung-Cheon & Yoon, Suk-Hun & Chung, Sung-Jin, 2007. "Minimizing maximum completion time in a proportionate flow shop with one machine of different speed," European Journal of Operational Research, Elsevier, vol. 176(2), pages 964-974, January.
    10. Leo Lopes & Kate Smith-Miles, 2013. "Generating Applicable Synthetic Instances for Branch Problems," Operations Research, INFORMS, vol. 61(3), pages 563-577, June.
    11. Vinod, V. & Sridharan, R., 2011. "Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system," International Journal of Production Economics, Elsevier, vol. 129(1), pages 127-146, January.
    12. Aldowaisan, Tariq & Allahverdi, Ali, 2004. "New heuristics for m-machine no-wait flowshop to minimize total completion time," Omega, Elsevier, vol. 32(5), pages 345-352, October.
    13. Joonyup Eun & Chang Sup Sung & Eun-Seok Kim, 2017. "Maximizing total job value on a single machine with job selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 998-1005, September.
    14. Benjamin C. Shelbourne & Maria Battarra & Chris N. Potts, 2017. "The Vehicle Routing Problem with Release and Due Dates," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 705-723, November.
    15. Joseph G. Szmerekovsky, 2005. "The Impact of Contractor Behavior on the Client's Payment-Scheduling Problem," Management Science, INFORMS, vol. 51(4), pages 629-640, April.
    16. Alexander A. Lazarev & Nikolay Pravdivets & Frank Werner, 2020. "On the Dual and Inverse Problems of Scheduling Jobs to Minimize the Maximum Penalty," Mathematics, MDPI, vol. 8(7), pages 1-15, July.
    17. Nicholas G. Hall & Zhixin Liu, 2010. "Capacity Allocation and Scheduling in Supply Chains," Operations Research, INFORMS, vol. 58(6), pages 1711-1725, December.
    18. Kedad-Sidhoum, Safia & Solis, Yasmin Rios & Sourd, Francis, 2008. "Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1305-1316, September.
    19. Joseph G. Szmerekovsky & George L. Vairaktarakis, 2006. "Maximizing project cash availability," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 272-284, June.
    20. Giorgi Tadumadze & Nils Boysen & Simon Emde, 2020. "Robust spotter scheduling in trailer yards," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 995-1021, December.

    More about this item

    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:spr:annopr:v:161:y:2008:i:1:p:87-102:10.1007/s10479-007-0302-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.