Some results on an assignment problem variant
Author
Abstract
Suggested Citation
DOI: 10.1007/s12597-020-00472-7
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- E. C. Keachie & Robert J. Fontana, 1966. "Effects of Learning on Optimal Lot Size," Management Science, INFORMS, vol. 13(2), pages 102-108, October.
- Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
- Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
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.- 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.
- 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.
- Mütze, Torsten, 2014. "Scheduling with few changes," European Journal of Operational Research, Elsevier, vol. 236(1), pages 37-50.
- 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.
- Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
- 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.
- 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.
- 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.
- 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.
- 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.
- Peng Liu & Xiaoli Wang, 2017. "Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date," Journal of Optimization, Hindawi, vol. 2017, pages 1-7, April.
- Ágoston, Kolos Csaba & Biró, Péter & Szántó, Richárd, 2018.
"Stable project allocation under distributional constraints,"
Operations Research Perspectives, Elsevier, vol. 5(C), pages 59-68.
- Kolos Csaba Agoston & Peter Biro & Richard Szanto, 2017. "Stable project allocation under distributional constraints," CERS-IE WORKING PAPERS 1733, Institute of Economics, Centre for Economic and Regional Studies.
- Qing Han, 2013. "Managing Emergencies Optimally Using a Random Neural Network-Based Algorithm," Future Internet, MDPI, vol. 5(4), pages 1-20, October.
- Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
- Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
- Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
- Ji-Bo Wang & Ming-Zheng Wang, 2011. "Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 191(1), pages 155-169, November.
- Emiliya Lazarova & Peter Borm & Arantza Estévez-Fernández, 2016.
"Transfers and exchange-stability in two-sided matching problems,"
Theory and Decision, Springer, vol. 81(1), pages 53-71, June.
- Emiliya Lazarova & Peter Borm & Arantza Estévez-Fernández, 2014. "Transfers and Exchange-Stability in Two-Sided Matching Problems," Tinbergen Institute Discussion Papers 14-086/II, Tinbergen Institute.
- Lazarova, E.A. & Borm, Peter & Estevez, Arantza, 2016. "Transfers and exchange-stability in two-sided matching problems," Other publications TiSEM e76da65e-c692-4ba3-a2c6-d, Tilburg University, School of Economics and Management.
- Black, Gary W. & McKay, Kenneth N. & Morton, Thomas E., 2006. "Aversion scheduling in the presence of risky jobs," European Journal of Operational Research, Elsevier, vol. 175(1), pages 338-361, November.
- Hwang, Juhwen & Wan, Yat-wah, 2013. "A supplier–retailer supply chain with intermediate storage for batch ordering," International Journal of Production Economics, Elsevier, vol. 142(2), pages 343-352.
More about this item
Keywords
Assignment problem variant; Negative changeover costs; Complexity result; NP-hard;All these keywords.
Statistics
Access and download statisticsCorrections
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.