An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead
Author
Abstract
Suggested Citation
DOI: 10.1142/S0217595915500475
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
- Kovalyov, Mikhail Y. & Ng, C.T. & Cheng, T.C. Edwin, 2007. "Fixed interval scheduling: Models, applications, computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 178(2), pages 331-342, April.
- Stanley P. Y. Fung & Chung Keung Poon & Feifeng Zheng, 2008. "Online interval scheduling: randomized and multiprocessor cases," Journal of Combinatorial Optimization, Springer, vol. 16(3), pages 248-262, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Feifeng Zheng & Yuhong Chen & Ming Liu & Yinfeng Xu, 2022. "Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1060-1076, September.
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.- Ge Yu & Sheldon H. Jacobson, 2020. "Primal-dual analysis for online interval scheduling problems," Journal of Global Optimization, Springer, vol. 77(3), pages 575-602, July.
- Meghan Shanks & Ge Yu & Sheldon H. Jacobson, 2023. "Approximation algorithms for stochastic online matching with reusable resources," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 98(1), pages 43-56, August.
- Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
- Lee, Soonhui & Turner, Jonathan & Daskin, Mark S. & Homem-de-Mello, Tito & Smilowitz, Karen, 2012. "Improving fleet utilization for carriers by interval scheduling," European Journal of Operational Research, Elsevier, vol. 218(1), pages 261-269.
- Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich & Bernhard Primas, 2018. "Models and algorithms for energy-efficient scheduling with immediate start of jobs," Journal of Scheduling, Springer, vol. 21(5), pages 505-516, October.
- Zhao, Chuan-Li & Tang, Heng-Yong, 2010. "Scheduling deteriorating jobs under disruption," International Journal of Production Economics, Elsevier, vol. 125(2), pages 294-299, June.
- Di Martinelly, Christine & Meskens, Nadine, 2017.
"A bi-objective integrated approach to building surgical teams and nurse schedule rosters to maximise surgical team affinities and minimise nurses' idle time,"
International Journal of Production Economics, Elsevier, vol. 191(C), pages 323-334.
- Christine Di Martinelly & Nadine Meskens, 2017. "A bi-objective integrated approach to building surgical teams and nurse schedule rosters to maximise surgical team affinities and minimise nurses' idle time," Post-Print hal-01745280, HAL.
- Danny Hermelin & Dvir Shabtay & Nimrod Talmon, 2019. "On the parameterized tractability of the just-in-time flow-shop scheduling problem," Journal of Scheduling, Springer, vol. 22(6), pages 663-676, December.
- Türsel Eliiyi, Deniz & Azizoglu, Meral, 2011. "Heuristics for operational fixed job scheduling problems with working and spread time constraints," International Journal of Production Economics, Elsevier, vol. 132(1), pages 107-121, July.
- 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.
- Eliiyi, Deniz Türsel & Ornek, Arslan & Karakütük, SadIk Serhat, 2009. "A vehicle scheduling problem with fixed trips and time limitations," International Journal of Production Economics, Elsevier, vol. 117(1), pages 150-161, January.
- Shabtay, Dvir, 2012. "The just-in-time scheduling problem in a flow-shop scheduling system," European Journal of Operational Research, Elsevier, vol. 216(3), pages 521-532.
- Nicolas Pinson & Frits C. R. Spieksma, 2019. "Online interval scheduling on two related machines: the power of lookahead," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 224-253, July.
- Ons Sassi & Ammar Oulamara, 2017. "Electric vehicle scheduling and optimal charging problem: complexity, exact and heuristic approaches," International Journal of Production Research, Taylor & Francis Journals, vol. 55(2), pages 519-535, January.
- Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2023. "Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models," European Journal of Operational Research, Elsevier, vol. 306(2), pages 828-848.
- Arne Herzel & Michael Hopf & Clemens Thielen, 2019. "Multistage interval scheduling games," Journal of Scheduling, Springer, vol. 22(3), pages 359-377, June.
- Zaidi, I. & Oulamara, A. & Idoumghar, L. & Basset, M., 2024. "Minimizing grid capacity in preemptive electric vehicle charging orchestration: Complexity, exact and heuristic approaches," European Journal of Operational Research, Elsevier, vol. 312(1), pages 22-37.
- Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
- Belaid, R. & T’kindt, V. & Esswein, C., 2012. "Scheduling batches in flowshop with limited buffers in the shampoo industry," European Journal of Operational Research, Elsevier, vol. 223(2), pages 560-572.
- 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.
More about this item
Keywords
Scheduling; online algorithm; equal-length intervals; lookahead;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:wsi:apjorx:v:32:y:2015:i:06:n:s0217595915500475. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.