IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v172y2009i1p447-45710.1007-s10479-009-0620-6.html
   My bibliography  Save this article

Assignment problems with changeover cost

Author

Listed:
  • Pritibhushan Sinha

Abstract

We consider some variant models, having changeover cost, of the assignment problem. In these models, multiple assignments to an operator are allowed. In addition to assignment costs, a changeover cost is incurred if an operator does one job after another is completed. Two different types of changeover costs and related two models are considered. Mathematical programming formulations are given for the models. When changeover costs are dependent on the operator but independent of the jobs and are non-negative, a linear programming model is obtained. For the case when changeover costs are dependent on the jobs, a linear integer programming formulation is obtained. We also show that, this problem is strongly NP-hard. A heuristic solution method is suggested for it. Numerical findings on the performance of the method are given. Copyright Springer Science+Business Media, LLC 2009

Suggested Citation

  • Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    • Handle: RePEc:spr:annopr:v:172:y:2009:i:1:p:447-457:10.1007/s10479-009-0620-6
    DOI: 10.1007/s10479-009-0620-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-009-0620-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-009-0620-6?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. Patrick Mills & Edward Tsang & John Ford, 2003. "Applying an Extended Guided Local Search to the Quadratic Assignment Problem," Annals of Operations Research, Springer, vol. 118(1), pages 121-135, February.
    2. Robert M. Nauss, 2003. "Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 249-266, August.
    3. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    4. Robert S. Garfinkel, 1971. "Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem," Operations Research, INFORMS, vol. 19(7), pages 1747-1751, December.
    5. M. L. Balinski, 1985. "Signature Methods for the Assignment Problem," Operations Research, INFORMS, vol. 33(3), pages 527-536, June.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Pritibhushan Sinha, 2021. "Some results on an assignment problem variant," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 144-147, March.
    2. Mütze, Torsten, 2014. "Scheduling with few changes," European Journal of Operational Research, Elsevier, vol. 236(1), pages 37-50.

    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. Jingqun Li & R. Tharmarasa & Daly Brown & Thia Kirubarajan & Krishna R. Pattipati, 2019. "A novel convex dual approach to three-dimensional assignment problem: theoretical analysis," Computational Optimization and Applications, Springer, vol. 74(2), pages 481-516, November.
    2. Ahmed Ghoniem & Tulay Flamand & Mohamed Haouari, 2016. "Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 575-588, August.
    3. Pisut Pongchairerks, 2023. "A Probabilistic Hill-Climbing Algorithm for the Single-Source Transportation Problem," Sustainability, MDPI, vol. 15(5), pages 1-14, February.
    4. M. Gaudioso & L. Moccia & M. F. Monaco, 2010. "Repulsive Assignment Problem," Journal of Optimization Theory and Applications, Springer, vol. 144(2), pages 255-273, February.
    5. Prabhjot Kaur & Kalpana Dahiya & Vanita Verma, 2021. "Time-cost trade-off analysis of a priority based assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 448-482, June.
    6. Jingqun Li & Thia Kirubarajan & R. Tharmarasa & Daly Brown & Krishna R. Pattipati, 2021. "A dual approach to multi-dimensional assignment problems," Journal of Global Optimization, Springer, vol. 81(3), pages 691-716, November.
    7. M Büther, 2010. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1582-1595, November.
    8. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    9. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    10. Ágoston, Kolos Csaba & Biró, Péter & Kováts, Endre & Jankó, Zsuzsanna, 2022. "College admissions with ties and common quotas: Integer programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 722-734.
    11. Qingzhu Yao & Xiaoyan Zhu & Way Kuo, 2014. "A Birnbaum-importance based genetic local search algorithm for component assignment problems," Annals of Operations Research, Springer, vol. 212(1), pages 185-200, January.
    12. Cai, Zhiqiang & Si, Shubin & Sun, Shudong & Li, Caitao, 2016. "Optimization of linear consecutive-k-out-of-n system with a Birnbaum importance-based genetic algorithm," Reliability Engineering and System Safety, Elsevier, vol. 152(C), pages 248-258.
    13. Büther, Marcel, 2007. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 632, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Chen, Liang & Tokuda, Naoyuki, 2001. "A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 57(1), pages 109-120.
    15. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    16. Yokoya, Daisuke & Duin, Cees W. & Yamada, Takeo, 2011. "A reduction approach to the repeated assignment problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 185-193, April.
    17. Walteros, Jose L. & Vogiatzis, Chrysafis & Pasiliao, Eduardo L. & Pardalos, Panos M., 2014. "Integer programming models for the multidimensional assignment problem with star costs," European Journal of Operational Research, Elsevier, vol. 235(3), pages 553-568.
    18. Ritter, Gunter & Pesch, Christoph, 2001. "Polarity-free automatic classification of chromosomes," Computational Statistics & Data Analysis, Elsevier, vol. 35(3), pages 351-372, January.
    19. Bożena Staruch & Bogdan Staruch, 2021. "Competence-based assignment of tasks to workers in factories with demand-driven manufacturing," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 553-565, June.
    20. Liu, Tian & Luo, Zhixing & Qin, Hu & Lim, Andrew, 2018. "A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints," European Journal of Operational Research, Elsevier, vol. 266(2), pages 487-497.

    More about this item

    Keywords

    Assignment problem; Changeover cost;

    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:172:y:2009:i:1:p:447-457:10.1007/s10479-009-0620-6. 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.