302
Views
17
CrossRef citations to date
0
Altmetric
Original Articles

Simulated annealing and metaheuristic for randomized priority search algorithms for the aerial refuelling parallel machine scheduling problem with due date-to-deadline windows and release times

&
Pages 67-87 | Received 05 May 2011, Accepted 21 Dec 2011, Published online: 18 Apr 2012

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (6)

Christopher Garcia. (2016) Resource-constrained scheduling with hard due windows and rejection penalties. Engineering Optimization 48:9, pages 1515-1528.
Read now
Ching-Jong Liao, Cheng-Hsiung Lee & Hsing-Tzu Tsai. (2016) Scheduling with multi-attribute set-up times on unrelated parallel machines. International Journal of Production Research 54:16, pages 4839-4853.
Read now
Peng Guo, Wenming Cheng & Yi Wang. (2015) Parallel machine scheduling with step-deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm. Engineering Optimization 47:11, pages 1564-1585.
Read now
Masoud Rabbani, Shadi Sadri, Neda Manavizadeh & Hamed Rafiei. (2015) A novel bi-level hierarchy towards available-to-promise in mixed-model assembly line sequencing problems. Engineering Optimization 47:7, pages 947-962.
Read now
Chris K.Y. Fung, C.K. Kwong, Kit Yan Chan & H. Jiang. (2014) A guided search genetic algorithm using mined rules for optimal affective product design. Engineering Optimization 46:8, pages 1094-1108.
Read now

Articles from other publishers (11)

Fatma Gzara, Samir Elhedhli, Ugur Yildiz & Gohram Baloch. (2020) Data-Driven Modeling and Optimization of the Order Consolidation Problem in E-Warehousing. INFORMS Journal on Optimization 2:4, pages 273-296.
Crossref
Mohammad Hossein Fazel Zarandi, Ali Akbar Sadat Asl, Shahabeddin Sotudian & Oscar Castillo. (2018) A state of the art review of intelligent scheduling. Artificial Intelligence Review 53:1, pages 501-593.
Crossref
Young-Bin Woo & Byung Soo Kim. (2018) Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities. Computers & Operations Research 95, pages 97-112.
Crossref
Arif Arin & Ghaith Rabadi. (2017) Integrating estimation of distribution algorithms versus Q-learning into Meta-RaPS for solving the 0-1 multidimensional knapsack problem. Computers & Industrial Engineering 112, pages 706-720.
Crossref
Andrew W. Palmer, Andrew J. Hill & Steven J. Scheding. (2017) Methods for Stochastic Collection and Replenishment (SCAR) optimisation for persistent autonomy. Robotics and Autonomous Systems 87, pages 51-65.
Crossref
Arif Arin & Ghaith Rabadi. (2016) Local search versus Path Relinking in metaheuristics: Redesigning Meta-RaPS with application to the multidimensional knapsack problem. Applied Soft Computing 46, pages 317-327.
Crossref
Reinaldo J. Moraga. 2016. Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling. Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling 95 108 .
Andrew W Palmer, Andrew J Hill & Steven J Scheding. (2014) Stochastic collection and replenishment (SCAR) optimisation for persistent autonomy. Stochastic collection and replenishment (SCAR) optimisation for persistent autonomy.
Fatemah Al-Duoli & Ghaith Rabadi. (2014) Data Mining based Hybridization of Meta-RaPS. Procedia Computer Science 36, pages 301-307.
Crossref
Andrew W. Palmer, Andrew J. Hill & Steven J. Scheding. (2013) Stochastic collection and replenishment (SCAR): Objective functions. Stochastic collection and replenishment (SCAR): Objective functions.
Fatemah Al-Duoli & Ghaith Rabadi. (2013) Employing Learning to Improve the Performance of Meta-RaPS. Procedia Computer Science 20, pages 46-51.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.