default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMd. Fazle Baki
Person information
- affiliation: University of Windsor, Odette School of Business, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Nusrat T. Chowdhury, Mohammed Fazle Baki, Ahmed Azab:
A Modeling and Hybridized Decomposition Approach for the Multi-level Capacitated Lot-Sizing Problem with Setup Carryover, Backlogging, and Emission Control. Oper. Res. Forum 5(3): 68 (2024)- 2023
- [j23]Nusrat T. Chowdhury, Md. Fazle Baki, Ahmed Azab
:
The Setup Carryover Assignment Problem. Oper. Res. Forum 4(2): 1-13 (2023) - 2022
- [j22]Morteza Mazloumian, Md. Fazle Baki, Majid Ahmadi:
A robust multiobjective integrated master surgery schedule and surgical case assignment model at a publicly funded hospital. Comput. Ind. Eng. 163: 107826 (2022) - 2021
- [j21]Justin Britt, Md. Fazle Baki, Ahmed Azab, Abderrahmane Chaouch, Xiangyong Li:
A stochastic hierarchical approach for the master surgical scheduling problem. Comput. Ind. Eng. 158: 107385 (2021) - 2020
- [j20]Soumitra Bhale, Ahmed Azab, Md. Fazle Baki:
Grouping and sequencing of machining operations for high-volume transfer lines. Int. J. Manuf. Technol. Manag. 34(3): 211-244 (2020)
2010 – 2019
- 2018
- [j19]Nusrat T. Chowdhury, Mohammed Fazle Baki, Ahmed Azab:
Dynamic Economic Lot-Sizing Problem: A new O(T) Algorithm for the Wagner-Whitin Model. Comput. Ind. Eng. 117: 6-18 (2018) - [j18]Xiangyong Li, Lanjian Zhu, Md. Fazle Baki, Ben A. Chaouch:
Tabu search and iterated local search for the cyclic bottleneck assignment problem. Comput. Oper. Res. 96: 120-130 (2018) - [j17]Ehsan Jafarian, Jafar Razmi, Md. Fazle Baki:
A flexible programming approach based on intuitionistic fuzzy optimization and geometric programming for solving multi-objective nonlinear programming problems. Expert Syst. Appl. 93: 245-256 (2018) - [j16]Hany Osman, Mohammed Fazle Baki:
A Cuckoo Search Algorithm to Solve Transfer Line Balancing Problems With Different Cutting Conditions. IEEE Trans. Engineering Management 65(3): 505-518 (2018) - 2017
- [j15]Alejandro Vital-Soto, Nusrat T. Chowdhury, Maral Zafar Allahyari, Ahmed Azab, Mohammed Fazle Baki:
Mathematical modeling and hybridized evolutionary LP local search method for lot-sizing with supplier selection, inventory shortage, and quantity discounts. Comput. Ind. Eng. 109: 96-112 (2017) - 2016
- [j14]Anand J. Kulkarni, Md. Fazle Baki, Ben A. Chaouch:
Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems. Eur. J. Oper. Res. 250(2): 427-447 (2016) - 2014
- [j13]Md. Fazle Baki, Ben A. Chaouch, Walid Abdul-Kader:
A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery. Comput. Oper. Res. 43: 225-236 (2014) - 2011
- [j12]Xiangyong Li, Md. Fazle Baki, Yash P. Aneja:
Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic. Comput. Oper. Res. 38(1): 152-164 (2011) - [j11]Walid Abdul-Kader, Ozhand Ganjavi, Md. Fazle Baki:
A nonlinear model for optimizing the performance of a multi-product production line. Int. Trans. Oper. Res. 18(5): 561-577 (2011) - 2010
- [j10]Xiangyong Li, Md. Fazle Baki, Yash P. Aneja:
An ant colony optimization metaheuristic for machine-part cell formation problems. Comput. Oper. Res. 37(12): 2071-2081 (2010) - [j9]Xiangyong Li, Yash P. Aneja, Md. Fazle Baki:
An ant colony optimization metaheuristic for single-path multicommodity network flow problems. J. Oper. Res. Soc. 61(9): 1340-1355 (2010)
2000 – 2009
- 2009
- [j8]Kanchan Das, Md. Fazle Baki, Xiangyong Li:
Optimization of operation and changeover time for production planning and scheduling in a flexible manufacturing system. Comput. Ind. Eng. 56(1): 283-293 (2009) - 2008
- [c1]Xiangyong Li, Yash P. Aneja, Md. Fazle Baki:
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks. COCOA 2008: 235-245 - 2007
- [j7]Md. Fazle Baki, Santosh N. Kabadi:
Some Necessary Conditions and a General Suffciency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling. Algorithmic Oper. Res. 2(1) (2007) - 2006
- [j6]Mohammed Fazle Baki:
A new asymmetric pyramidally solvable class of the traveling salesman problem. Oper. Res. Lett. 34(6): 613-620 (2006) - 2004
- [j5]Mohammed Fazle Baki, Raymond G. Vickson:
One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective. Optim. Methods Softw. 19(2): 165-178 (2004)
1990 – 1999
- 1999
- [j4]Santosh N. Kabadi, Md. Fazle Baki:
Gilmore-Gomory type traveling salesman problems. Comput. Oper. Res. 26(4): 329-351 (1999) - [j3]Md. Fazle Baki, Santosh N. Kabadi:
Pyramidal traveling salesman problem. Comput. Oper. Res. 26(4): 353-369 (1999) - 1998
- [j2]Mohammed Fazle Baki:
Error Noted in a Paper by Jacobs, Silan, and Clemson. Interfaces 28(2): 121-122 (1998) - [j1]Md. Fazle Baki, Santosh N. Kabadi:
A generalization of the convex-hull-and-line traveling salesman problem. Adv. Decis. Sci. 2(2): 177-191 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
