Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2015.06.058
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
- Dudek, Gregor & Stadtler, Hartmut, 2005. "Negotiation-based collaborative planning between supply chains partners," European Journal of Operational Research, Elsevier, vol. 163(3), pages 668-687, June.
- Andrew Cook & Graham Tanner & Adrian Lawes, 2012. "The Hidden Cost of Airline Unpunctuality," Journal of Transport Economics and Policy, University of Bath, vol. 46(2), pages 157-173, May.
- Alessandro Agnetis & Gianluca De Pascale & Marco Pranzo, 2009. "Computing the Nash solution for scheduling bargaining problems," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 6(1), pages 54-69.
- Mor, Baruch & Mosheiov, Gur, 2010. "Scheduling problems with two competing agents to minimize minmax and minsum earliness measures," European Journal of Operational Research, Elsevier, vol. 206(3), pages 540-546, November.
- Mark Klein & Peyman Faratin & Hiroki Sayama & Yaneer Bar-Yam, 2003. "Negotiating Complex Contracts," Group Decision and Negotiation, Springer, vol. 12(2), pages 111-125, March.
- N.R. Jennings & P. Faratin & A.R. Lomuscio & S. Parsons & M.J. Wooldridge & C. Sierra, 2001. "Automated Negotiation: Prospects, Methods and Challenges," Group Decision and Negotiation, Springer, vol. 10(2), pages 199-215, March.
- Zhang, Linlan & Song, Haigang & Chen, Xueguang & Hong, Liu, 2011. "A simultaneous multi-issue negotiation through autonomous agents," European Journal of Operational Research, Elsevier, vol. 210(1), pages 95-105, April.
- Allesandro Agnetis & Pitu B. Mirchandani & Dario Pacciarelli & Andrea Pacifici, 2004. "Scheduling Problems with Two Competing Agents," Operations Research, INFORMS, vol. 52(2), pages 229-242, April.
- Geiger, Martin Josef, 2007. "On operators and search space topology in multi-objective flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 181(1), pages 195-206, August.
- Kersten, Gregory E. & Mallory, Geoffrey R., 1990. "Supporting problem representations in decisions with strategic interactions," European Journal of Operational Research, Elsevier, vol. 46(2), pages 200-215, May.
- John C. Harsanyi, 1955. "Cardinal Welfare, Individualistic Ethics, and Interpersonal Comparisons of Utility," Journal of Political Economy, University of Chicago Press, vol. 63(4), pages 309-309.
- Alessandro Agnetis & Dario Pacciarelli & Andrea Pacifici, 2007. "Multi-agent single machine scheduling," Annals of Operations Research, Springer, vol. 150(1), pages 3-15, March.
- Giuseppe Confessore & Stefano Giordani & Silvia Rismondo, 2007. "A market-based multi-agent system model for decentralized multi-project scheduling," Annals of Operations Research, Springer, vol. 150(1), pages 115-135, March.
- Katsuhide Fujita & Takayuki Ito & Mark Klein, 2012. "A Secure and Fair Protocol that Addresses Weaknesses of the Nash Bargaining Solution in Nonlinear Negotiation," Group Decision and Negotiation, Springer, vol. 21(1), pages 29-47, January.
- Myerson, Roger B, 1981. "Utilitarianism, Egalitarianism, and the Timing Effect in Social Choice Problems," Econometrica, Econometric Society, vol. 49(4), pages 883-897, June.
- Balasubramanian, Hari & Fowler, John & Keha, Ahmet & Pfund, Michele, 2009. "Scheduling interfering job sets on parallel machines," European Journal of Operational Research, Elsevier, vol. 199(1), pages 55-67, November.
- Geiger, Martin Josef, 2010. "On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1235-1243, December.
- Strbac, Goran, 2008. "Demand side management: Benefits and challenges," Energy Policy, Elsevier, vol. 36(12), pages 4419-4426, December.
- Cheng, T.C.E. & Ng, C.T. & Yuan, J.J., 2008. "Multi-agent scheduling on a single machine with max-form criteria," European Journal of Operational Research, Elsevier, vol. 188(2), pages 603-609, July.
- Fabian Lang & Andreas Fink, 2015. "Learning from the Metaheuristics: Protocols for Automated Negotiations," Group Decision and Negotiation, Springer, vol. 24(2), pages 299-332, March.
- Bodenstein, Christian & Schryen, Guido & Neumann, Dirk, 2012. "Energy-aware workload management models for operation cost reduction in data centers," European Journal of Operational Research, Elsevier, vol. 222(1), pages 157-167.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Fink, Andreas & Gerhards, Patrick, 2021. "Negotiation mechanisms for the multi-agent multi-mode resource investment problem," European Journal of Operational Research, Elsevier, vol. 295(1), pages 261-274.
- T’kindt, Vincent & Della Croce, Federico & Agnetis, Alessandro, 2024. "Single machine adversarial bilevel scheduling problems," European Journal of Operational Research, Elsevier, vol. 315(1), pages 63-72.
- Kuen-Fang Jea & Jen-Ya Wang & Chih-Wei Hsu, 2019. "Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(03), pages 1-24, June.
- Homberger, Jörg & Fink, Andreas, 2017. "Generic negotiation mechanisms with side payments – Design, analysis and application for decentralized resource-constrained multi-project scheduling problems," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1001-1012.
- Gudmundsson, Jens & Hougaard, Jens Leth & Platz, Trine Tornøe, 2023.
"Decentralized task coordination,"
European Journal of Operational Research, Elsevier, vol. 304(2), pages 851-864.
- Jens Gudmundsson & Jens Leth Hougaard & Trine Tornøe Platz, 2020. "Decentralized Task Coordination," IFRO Working Paper 2020/11, University of Copenhagen, Department of Food and Resource Economics.
- Gärttner, Johannes & Flath, Christoph M. & Weinhardt, Christof, 2018. "Portfolio and contract design for demand response resources," European Journal of Operational Research, Elsevier, vol. 266(1), pages 340-353.
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.- Perez-Gonzalez, Paz & Framinan, Jose M., 2014. "A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 1-16.
- Cheng, Shuenn-Ren, 2014. "Some new problems on two-agent scheduling to minimize the earliness costs," International Journal of Production Economics, Elsevier, vol. 156(C), pages 24-30.
- Wang, Du-Juan & Yin, Yunqiang & Xu, Jianyou & Wu, Wen-Hsiang & Cheng, Shuenn-Ren & Wu, Chin-Chia, 2015. "Some due date determination scheduling problems with two agents on a single machine," International Journal of Production Economics, Elsevier, vol. 168(C), pages 81-90.
- Xiaoling Cao & Wen-Hsing Wu & Wen-Hung Wu & Chin-Chia Wu, 2018. "Some two-agent single-machine scheduling problems to minimize minmax and minsum of completion times," Operational Research, Springer, vol. 18(2), pages 293-314, July.
- Shi-Sheng Li & Ren-Xia Chen & Qi Feng, 2016. "Scheduling two job families on a single machine with two competitive agents," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 784-799, October.
- Fan, B.Q. & Cheng, T.C.E., 2016. "Two-agent scheduling in a flowshop," European Journal of Operational Research, Elsevier, vol. 252(2), pages 376-384.
- Byung-Gyoo Kim & Byung-Cheon Choi & Myoung-Ju Park, 2017. "Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(04), pages 1-17, August.
- Yunqiang Yin & T. C. E. Cheng & Du-Juan Wang & Chin-Chia Wu, 2017. "Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs," Journal of Scheduling, Springer, vol. 20(4), pages 313-335, August.
- Zhang, Xingong, 2021. "Two competitive agents to minimize the weighted total late work and the total completion time," Applied Mathematics and Computation, Elsevier, vol. 406(C).
- Nong, Q.Q. & Cheng, T.C.E. & Ng, C.T., 2011. "Two-agent scheduling to minimize the total cost," European Journal of Operational Research, Elsevier, vol. 215(1), pages 39-44, November.
- Cheng He & Chunqi Xu & Hao Lin, 2020. "Serial-batching scheduling with two agents to minimize makespan and maximum cost," Journal of Scheduling, Springer, vol. 23(5), pages 609-617, October.
- Byung-Cheon Choi & Myoung-Ju Park, 2016. "An Ordered Flow Shop with Two Agents," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-24, October.
- Shesh Narayan Sahu & Yuvraj Gajpal & Swapan Debbarma, 2018. "Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives," Annals of Operations Research, Springer, vol. 269(1), pages 623-640, October.
- Koulamas, Christos, 2015. "A note on scheduling problems with competing agents and earliness minimization objectives," European Journal of Operational Research, Elsevier, vol. 245(3), pages 875-876.
- Ren-Xia Chen & Shi-Sheng Li, 2019. "Two-agent single-machine scheduling with cumulative deterioration," 4OR, Springer, vol. 17(2), pages 201-219, June.
- Omri Dover & Dvir Shabtay, 2016. "Single machine scheduling with two competing agents, arbitrary release dates and unit processing times," Annals of Operations Research, Springer, vol. 238(1), pages 145-178, March.
- Fabian Lang & Andreas Fink, 2015. "Learning from the Metaheuristics: Protocols for Automated Negotiations," Group Decision and Negotiation, Springer, vol. 24(2), pages 299-332, March.
- Joseph Y.-T. Leung & Michael Pinedo & Guohua Wan, 2010. "Competitive Two-Agent Scheduling and Its Applications," Operations Research, INFORMS, vol. 58(2), pages 458-469, April.
- Zhang Xingong & Wang Yong, 2017. "Two-agent scheduling problems on a single-machine to minimize the total weighted late work," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 945-955, April.
- Du-Juan Wang & Yunqiang Yin & Shuenn-Ren Cheng & T.C.E. Cheng & Chin-Chia Wu, 2016. "Due date assignment and scheduling on a single machine with two competing agents," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1152-1169, February.
More about this item
Keywords
Group decisions and negotiations; Scheduling; Negotiation protocol; Mechanism design; Complex contracts;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:eee:ejores:v:248:y:2016:i:1:p:192-203. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.