The resource dependent assignment problem with a convex agent cost function
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2017.03.004
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
- Chung-Yee Lee & Lei Lei, 2001. "Multiple-Project Scheduling with Controllable Project Duration and Hard Resource Constraint: Some Solvable Cases," Annals of Operations Research, Springer, vol. 102(1), pages 287-307, February.
- Dvir Shabtay & George Steiner, 2008. "The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times," Annals of Operations Research, Springer, vol. 159(1), pages 25-40, March.
- Clyde L. Monma & Alexander Schrijver & Michael J. Todd & Victor K. Wei, 1990. "Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions," Mathematics of Operations Research, INFORMS, vol. 15(4), pages 736-748, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Xuyin Wang & Weiguo Liu, 2024. "Optimal Different Due-Date Assignment Scheduling with Group Technology and Resource Allocation," Mathematics, MDPI, vol. 12(3), pages 1-17, 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.- Shabtay, Dvir & Zofi, Moshe, 2018. "Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 198(C), pages 191-200.
- Koulamas, Christos & Gupta, Sushil & Kyparisis, George J., 2010. "A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times," European Journal of Operational Research, Elsevier, vol. 205(2), pages 479-482, September.
- Yim, Seho & Hong, Sung-Pil & Park, Myoung-Ju & Chung, Yerim, 2022. "Inverse interval scheduling via reduction on a single machine," European Journal of Operational Research, Elsevier, vol. 303(2), pages 541-549.
- Yedidsion, Liron & Shabtay, Dvir & Korach, Ephraim & Kaspi, Moshe, 2009. "A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine," International Journal of Production Economics, Elsevier, vol. 119(2), pages 298-307, June.
- Shabtay, Dvir, 2022. "Single-machine scheduling with machine unavailability periods and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 296(2), pages 423-439.
- Oron, Daniel, 2016. "Scheduling controllable processing time jobs with position-dependent workloads," International Journal of Production Economics, Elsevier, vol. 173(C), pages 153-160.
- Yaron Leyvand & Dvir Shabtay & George Steiner & Liron Yedidsion, 2010. "Just-in-time scheduling with controllable processing times on parallel machines," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 347-368, April.
- Kailiang Xu & Zuren Feng & Liangjun Ke, 2010. "A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates," Annals of Operations Research, Springer, vol. 181(1), pages 303-324, December.
- Herroelen, Willy & Leus, Roel, 2004. "The construction of stable project baseline schedules," European Journal of Operational Research, Elsevier, vol. 156(3), pages 550-565, August.
- Leyvand, Yaron & Shabtay, Dvir & Steiner, George, 2010. "A unified approach for scheduling with convex resource consumption functions using positional penalties," European Journal of Operational Research, Elsevier, vol. 206(2), pages 301-312, October.
- Shaojun Lu & Min Kong & Zhiping Zhou & Xinbao Liu & Siwen Liu, 2022. "A hybrid metaheuristic for a semiconductor production scheduling problem with deterioration effect and resource constraints," Operational Research, Springer, vol. 22(5), pages 5405-5440, November.
- Zong-Jun Wei & Li-Yan Wang & Lei Zhang & Ji-Bo Wang & Ershen Wang, 2023. "Single-Machine Maintenance Activity Scheduling with Convex Resource Constraints and Learning Effects," Mathematics, MDPI, vol. 11(16), pages 1-21, August.
- Choi, Byung-Cheon & Briskorn, Dirk, 2010. "Project scheduling with processing time compression cost and lateness penalties," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 651, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Lvjiang Yin & Xinyu Li & Chao Lu & Liang Gao, 2016. "Energy-Efficient Scheduling Problem Using an Effective Hybrid Multi-Objective Evolutionary Algorithm," Sustainability, MDPI, vol. 8(12), pages 1-33, December.
- Baruch Mor & Gur Mosheiov, 2021. "Minmax due-date assignment on a two-machine flowshop," Annals of Operations Research, Springer, vol. 305(1), pages 191-209, October.
- S.S. Panwalkar & Christos Koulamas, 2015. "On equivalence between the proportionate flow shop and single‐machine scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(7), pages 595-603, October.
- Du-Juan Wang & Yunqiang Yin & Mengqi Liu, 2016. "Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3691-3705, June.
- George Steiner & Rui Zhang, 2011. "Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries," Annals of Operations Research, Springer, vol. 191(1), pages 171-181, November.
- Koulamas, Christos, 2011. "A unified solution approach for the due date assignment problem with tardy jobs," International Journal of Production Economics, Elsevier, vol. 132(2), pages 292-295, August.
- Shabtay, Dvir & Steiner, George & Zhang, Rui, 2016. "Optimal coordination of resource allocation, due date assignment and scheduling decisions," Omega, Elsevier, vol. 65(C), pages 41-54.
More about this item
Keywords
Scheduling; Assignment problem; Bicriteria optimization; Controllable processing times; Approximation algorithm;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:261:y:2017:i:2:p:486-502. 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.