322
Views
14
CrossRef citations to date
0
Altmetric
Original Articles

A bi-objective MILP model for blocking hybrid flexible flow shop scheduling problem: robust possibilistic programming approach

, &
Pages 137-146 | Received 19 Oct 2017, Accepted 22 Jul 2018, Published online: 23 Oct 2018

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

Read on this site (5)

M. Hajibabaei & J. Behnamian. (2021) Flexible job-shop scheduling problem with unrelated parallel machines and resources-dependent processing times: a tabu search algorithm. International Journal of Management Science and Engineering Management 16:4, pages 242-253.
Read now
J. Behnamian. (2021) Multi-agent capacitated scheduling for profit-maximizing using a decomposition-based branch and cut algorithm. International Journal of Management Science and Engineering Management 16:2, pages 73-82.
Read now
Nader Ghaffarinasab, Abdullah Zare Andaryan & Ali Ebadi Torkayesh. (2020) Robust single allocation p-hub median problem under hose and hybrid demand uncertainties: models and algorithms. International Journal of Management Science and Engineering Management 15:3, pages 184-195.
Read now
Mohd Fadzil Faisae Ab Rashid & Muhammad Ammar Nik Mu’tasim. Cost-based hybrid flow shop scheduling with uniform machine optimization using an improved tiki-taka algorithm. Journal of Industrial and Production Engineering 0:0, pages 1-18.
Read now

Articles from other publishers (9)

Eyüp Ensar Işık, Seyda Topaloglu Yildiz & Özge Şatır Akpunar. (2023) Constraint programming models for the hybrid flow shop scheduling problem and its extensions. Soft Computing 27:24, pages 18623-18650.
Crossref
Janis S. Neufeld, Sven Schulz & Udo Buscher. (2023) A systematic review of multi-objective hybrid flow shop scheduling. European Journal of Operational Research 309:1, pages 1-23.
Crossref
Lingxin Wang, Rosa Abbou & Catherine Da Cunha. (2023) A Multi-Stage Model for Sustainable Scheduling in Hybrid Flexible Flow Shop. A Multi-Stage Model for Sustainable Scheduling in Hybrid Flexible Flow Shop.
Julián Alberto Espejo-Díaz, Edgar Alfonso-Lizarazo & Jairo R. Montoya-Torres. (2023) A heuristic approach for scheduling advanced air mobility aircraft at vertiports. Applied Mathematical Modelling.
Crossref
Iyad Abu Doush, Mohammed Azmi Al-Betar, Mohammed A. Awadallah, Zaid Abdi Alkareem Alyasseri, Sharif Naser Makhadmeh & Mohammed El-Abd. (2022) Island neighboring heuristics harmony search algorithm for flow shop scheduling with blocking. Swarm and Evolutionary Computation 74, pages 101127.
Crossref
Meysam Kazemi Esfeh, Amir Abbas Shojaie, Hasan Javanshir & Kaveh Khalili-Damghani. (2022) Flexible Flow Shop Scheduling Problem with Reliable Transporters and Intermediate Limited Buffers via considering Learning Effects and Budget Constraint. Complexity 2022, pages 1-19.
Crossref
Xin-Rui Tao, Quan-Ke Pan & Liang Gao. (2022) An efficient self-adaptive artificial bee colony algorithm for the distributed resource-constrained hybrid flowshop problem. Computers & Industrial Engineering 169, pages 108200.
Crossref
Xin-Rui Tao, Bao-Jiang Wu & Quan-Ke Pan. (2022) Discrete Artificial Bee Colony Algorithm for the Distributed Resource Constrained Hybrid Flowshop Problem. Discrete Artificial Bee Colony Algorithm for the Distributed Resource Constrained Hybrid Flowshop Problem.
Azadeh Dogani, Arash Dourandish, Mohammad Ghorbani & Mohammad Reza Shahbazbegian. (2020) A Hybrid Meta-Heuristic for a Bi-Objective Stochastic Optimization of Urban Water Supply System. IEEE Access 8, pages 135829-135843.
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.