IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v58y2021i1d10.1007_s12597-020-00472-7.html
   My bibliography  Save this article

Some results on an assignment problem variant

Author

Listed:
  • Pritibhushan Sinha

Abstract

We consider a model of an assignment problem, in which an operator can do one job, multiple jobs, or no job at all. There is a job changeover cost, for any extra assignment in excess of one. The changeover costs depend only on the operator, but can be negative. We give a nonlinear integer programming formulation of the problem. We show that, the problem is NP-hard.

Suggested Citation

  • Pritibhushan Sinha, 2021. "Some results on an assignment problem variant," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 144-147, March.
  • Handle: RePEc:spr:opsear:v:58:y:2021:i:1:d:10.1007_s12597-020-00472-7
    DOI: 10.1007/s12597-020-00472-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-020-00472-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s12597-020-00472-7?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. G Mosheiov, 2001. "Parallel machine scheduling with a learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(10), pages 1165-1169, October.
    2. E. C. Keachie & Robert J. Fontana, 1966. "Effects of Learning on Optimal Lot Size," Management Science, INFORMS, vol. 13(2), pages 102-108, October.
    3. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    4. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    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. Biskup, Dirk, 2008. "A state-of-the-art review on scheduling with learning effects," European Journal of Operational Research, Elsevier, vol. 188(2), pages 315-329, July.
    2. Yang, Wen-Hua & Chand, Suresh, 2008. "Learning and forgetting effects on a group scheduling problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1033-1044, June.
    3. Mütze, Torsten, 2014. "Scheduling with few changes," European Journal of Operational Research, Elsevier, vol. 236(1), pages 37-50.
    4. Zoltán Varga & Pál Simon, 2014. "Examination Of Scheduling Methods For Production Systems," Advanced Logistic systems, University of Miskolc, Department of Material Handling and Logistics, vol. 8(1), pages 111-120, December.
    5. 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.
    6. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    7. Radosław Rudek, 2012. "Scheduling problems with position dependent job processing times: computational complexity results," Annals of Operations Research, Springer, vol. 196(1), pages 491-516, July.
    8. Á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.
    9. 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.
    10. 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.
    11. Jin Qian & Yu Zhan, 2022. "Single-Machine Group Scheduling Model with Position-Dependent and Job-Dependent DeJong’s Learning Effect," Mathematics, MDPI, vol. 10(14), pages 1-9, July.
    12. 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.
    13. 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.
    14. 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.
    15. Jun Pei & Bayi Cheng & Xinbao Liu & Panos M. Pardalos & Min Kong, 2019. "Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time," Annals of Operations Research, Springer, vol. 272(1), pages 217-241, January.
    16. B. C. Giri & M. Masanta, 2022. "A closed-loop supply chain model with uncertain return and learning-forgetting effect in production under consignment stock policy," Operational Research, Springer, vol. 22(2), pages 947-975, April.
    17. Chung-Lun Li, 2008. "A note on unrelated parallel machine scheduling with time-dependent processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1696-1697, December.
    18. Krumke, Sven O. & Thielen, Clemens, 2013. "The generalized assignment problem with minimum quantities," European Journal of Operational Research, Elsevier, vol. 228(1), pages 46-55.
    19. Chiu, Huan Neng & Chen, Hsin Min, 2005. "An optimal algorithm for solving the dynamic lot-sizing model with learning and forgetting in setups and production," International Journal of Production Economics, Elsevier, vol. 95(2), pages 179-193, February.
    20. Qian, Jianbo & Steiner, George, 2013. "Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine," European Journal of Operational Research, Elsevier, vol. 225(3), pages 547-551.

    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:opsear:v:58:y:2021:i:1:d:10.1007_s12597-020-00472-7. 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.