Md. Fazle Baki

Orcid: 0000-0002-8438-6080

Affiliations:
  • University of Windsor, Odette School of Business, Canada


According to our database1, Md. Fazle Baki authored at least 24 papers between 1998 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The Setup Carryover Assignment Problem.
Oper. Res. Forum, June, 2023

2022
A robust multiobjective integrated master surgery schedule and surgical case assignment model at a publicly funded hospital.
Comput. Ind. Eng., 2022

2021
A stochastic hierarchical approach for the master surgical scheduling problem.
Comput. Ind. Eng., 2021

2020
Grouping and sequencing of machining operations for high-volume transfer lines.
Int. J. Manuf. Technol. Manag., 2020

2018
A Cuckoo Search Algorithm to Solve Transfer Line Balancing Problems With Different Cutting Conditions.
IEEE Trans. Engineering Management, 2018

A flexible programming approach based on intuitionistic fuzzy optimization and geometric programming for solving multi-objective nonlinear programming problems.
Expert Syst. Appl., 2018

Tabu search and iterated local search for the cyclic bottleneck assignment problem.
Comput. Oper. Res., 2018

Dynamic Economic Lot-Sizing Problem: A new <i>O</i>(<i>T</i>) Algorithm for the Wagner-Whitin Model.
Comput. Ind. Eng., 2018

2017
Mathematical modeling and hybridized evolutionary LP local search method for lot-sizing with supplier selection, inventory shortage, and quantity discounts.
Comput. Ind. Eng., 2017

2016
Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems.
Eur. J. Oper. Res., 2016

2014
A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery.
Comput. Oper. Res., 2014

2011
A nonlinear model for optimizing the performance of a multi-product production line.
Int. Trans. Oper. Res., 2011

Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic.
Comput. Oper. Res., 2011

2010
An ant colony optimization metaheuristic for single-path multicommodity network flow problems.
J. Oper. Res. Soc., 2010

An ant colony optimization metaheuristic for machine-part cell formation problems.
Comput. Oper. Res., 2010

2009
Optimization of operation and changeover time for production planning and scheduling in a flexible manufacturing system.
Comput. Ind. Eng., 2009

2008
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
Some Necessary Conditions and a General Suffciency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling.
Algorithmic Oper. Res., 2007

2006
A new asymmetric pyramidally solvable class of the traveling salesman problem.
Oper. Res. Lett., 2006

2004
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., 2004

1999
Gilmore-Gomory type traveling salesman problems.
Comput. Oper. Res., 1999

Pyramidal traveling salesman problem.
Comput. Oper. Res., 1999

1998
A generalization of the convex-hull-and-line traveling salesman problem.
Adv. Decis. Sci., 1998

Error Noted in a Paper by Jacobs, Silan, and Clemson.
Interfaces, 1998


  Loading...