Online scheduling to minimize total weighted (modified) earliness and tardiness cost
Author
Abstract
Suggested Citation
DOI: 10.1007/s10951-021-00698-3
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
- Edward J. Anderson & Chris N. Potts, 2004. "Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 686-697, August.
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.- C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
- Xing Chai & Lingfa Lu & Wenhua Li & Liqi Zhang, 2018. "Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(06), pages 1-11, December.
- Dengpan Liu & Sumit Sarkar & Chelliah Sriskandarajah, 2010. "Resource Allocation Policies for Personalization in Content Delivery Sites," Information Systems Research, INFORMS, vol. 21(2), pages 227-248, June.
- Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
- Nicole Megow & Marc Uetz & Tjark Vredeveld, 2006. "Models and Algorithms for Stochastic Online Scheduling," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 513-525, August.
- Lingfa Lu & Liqi Zhang, 2017. "Online Single Machine Scheduling to Minimize the Maximum Starting Time," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(05), pages 1-9, October.
- Sitters, R.A., 2009. "Efficient algorithms for average completion time scheduling," Serie Research Memoranda 0058, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
- Ma, Ran & Guo, Sainan, 2021. "Applying “Peeling Onion” approach for competitive analysis in online scheduling with rejection," European Journal of Operational Research, Elsevier, vol. 290(1), pages 57-67.
- Birgit Heydenreich & Rudolf Müller & Marc Uetz, 2010. "Mechanism Design for Decentralized Online Machine Scheduling," Operations Research, INFORMS, vol. 58(2), pages 445-457, April.
- Ma, Ran & Tao, Jiping & Yuan, Jinjiang, 2016. "Online scheduling with linear deteriorating jobs to minimize the total weighted completion time," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 570-583.
- Xiaoyan Zhang & Ran Ma & Jian Sun & Zan-Bo Zhang, 2022. "Randomized selection algorithm for online stochastic unrelated machines scheduling," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1796-1811, October.
- Wenjie Li & Hailing Liu & Shisheng Li, 2018. "Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(04), pages 1-12, August.
- Heydenreich, B. & Müller, R.J. & Uetz, M.J., 2006. "Decentralization and mechanism design for online machine scheduling," Research Memorandum 007, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Nicholas G. Hall & Marc E. Posner & Chris N. Potts, 2009. "Online Scheduling with Known Arrival Times," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 92-102, February.
- Ma, Ran & Yuan, Jinjiang, 2014. "Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time," International Journal of Production Economics, Elsevier, vol. 158(C), pages 114-119.
- Wenhua Li & Xing Chai, 2019. "The medical laboratory scheduling for weighted flow-time," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 83-94, January.
- Xiaoyan Zhang & Ran Ma & Jian Sun & Zan-Bo Zhang, 0. "Randomized selection algorithm for online stochastic unrelated machines scheduling," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.
- Xing Chai & Wenhua Li & Yuejuan Zhu, 2021. "Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine," Annals of Operations Research, Springer, vol. 298(1), pages 79-93, March.
- Péter Györgyi & Tamás Kis & Tímea Tamási & József Békési, 2023. "Joint replenishment meets scheduling," Journal of Scheduling, Springer, vol. 26(1), pages 77-94, February.
- Ran Ma & Jinjiang Yuan, 2017. "Online scheduling to minimize the total weighted completion time plus the rejection cost," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 483-503, August.
More about this item
Keywords
Online scheduling; Single machine; Online algorithm; Competitive analysis; Competitive ratio; Earliness and tardiness;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:jsched:v:24:y:2021:i:4:d:10.1007_s10951-021-00698-3. 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.