default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaeed Zolfaghari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j26]Tina Allehashemi, Saman Hassanzadeh Amin, Saeed Zolfaghari:
A proposed multi-objective model for cellphone closed-loop supply chain optimization based on fuzzy QFD. Expert Syst. Appl. 210: 118577 (2022)- 2021
- [j25]Omid Jadidi, Mohamad Y. Jaber, Saeed Zolfaghari, Roberto Pinto, Fatemeh Firouzi:
Dynamic pricing and lot sizing for a newsvendor problem with supplier selection, quantity discounts, and limited supply capacity. Comput. Ind. Eng. 154: 107113 (2021) - [j24]Amirhossein Bazargan
, Salma Karray, Saeed Zolfaghari:
Can restrictions on redemption timing boost profitability of loyalty programs in competitive environments? Comput. Manag. Sci. 18(1): 99-124 (2021) - [j23]Joseph Ryan Glover, Vinh Quan, Saeed Zolfaghari:
Some new perspectives for solving 0-1 integer programming problems using Balas method. Comput. Manag. Sci. 18(2): 177-193 (2021) - 2020
- [j22]Amirhossein Bazargan, Saeed Zolfaghari, Salma Karray:
Should competing firms offer 'Buy n times, get one free' loyalty programs? A game-theoretic analysis. J. Oper. Res. Soc. 71(2): 280-300 (2020)
2010 – 2019
- 2019
- [j21]Amir Gandomi, Amirhossein Bazargan, Saeed Zolfaghari:
Designing competitive loyalty programs: a stochastic game-theoretic model to guide the choice of reward structure. Ann. Oper. Res. 280(1-2): 267-298 (2019) - 2018
- [j20]Amirhossein Bazargan, Salma Karray, Saeed Zolfaghari:
'Buy n times, get one free' loyalty cards: Are they profitable for competing firms? A game theoretic analysis. Eur. J. Oper. Res. 265(2): 621-630 (2018) - [j19]Michael A. Greig, Judy Village, Filippo A. Salustri, Saeed Zolfaghari, W. Patrick Neumann:
A tool to predict physical workload and task times from workstation layout design data. Int. J. Prod. Res. 56(16): 5306-5323 (2018) - 2017
- [j18]Omid Jadidi, Mohamad Y. Jaber, Saeed Zolfaghari:
Joint pricing and inventory problem with price dependent stochastic demand and price discounts. Comput. Ind. Eng. 114: 45-53 (2017) - [j17]Katherine Goff Inglis, Saeed Zolfaghari:
A Review of Scheduling Problems and Research Opportunities in Motion Picture Exhibition. Interfaces 47(2): 175-187 (2017) - 2016
- [j16]Abdullah Aldamak, Adel Hatami-Marbini, Saeed Zolfaghari:
Dual frontiers without convexity. Comput. Ind. Eng. 101: 466-478 (2016) - [j15]Omid Jadidi, Sharareh Taghipour, Saeed Zolfaghari:
A two-price policy for a newsvendor product supply chain with time and price sensitive demand. Eur. J. Oper. Res. 253(1): 132-143 (2016) - 2013
- [j14]Muhammad Ardalani-Farsa, Saeed Zolfaghari:
Taguchi's Design of Experiment in Combination Selection for a Chaotic Time Series Forecasting Method using Ensemble Artificial Neural Networks. Cybern. Syst. 44(4): 351-377 (2013) - 2011
- [j13]Muhammad Ardalani-Farsa, Saeed Zolfaghari:
Residual Analysis and Combination of Embedding Theorem and Artificial Intelligence in Chaotic Time Series Forecasting. Appl. Artif. Intell. 25(1): 45-73 (2011) - [j12]Amir Gandomi, Saeed Zolfaghari:
A stochastic model on the profitability of loyalty programs. Comput. Ind. Eng. 61(3): 482-488 (2011) - 2010
- [j11]Muhammad Ardalani-Farsa, Saeed Zolfaghari:
Chaotic time series prediction with residual analysis method using hybrid Elman-NARX neural networks. Neurocomputing 73(13-15): 2540-2553 (2010) - [j10]M. Mahdi Tajbakhsh, Chi-Guhn Lee, Saeed Zolfaghari:
On the supplier diversification under binomial yield. Oper. Res. Lett. 38(6): 505-509 (2010)
2000 – 2009
- 2009
- [j9]Majid Tolouei-Rad, Saeed Zolfaghari:
Productivity improvement using Special-Purpose Modular machine tools. Int. J. Manuf. Res. 4(2): 219-235 (2009) - 2008
- [j8]Kouroush Jenab, Saeed Zolfaghari:
A virtual collaborative maintenance architecture for manufacturing enterprises. J. Intell. Manuf. 19(6): 763-771 (2008) - 2007
- [j7]Ahmed W. El-Bouri, Nader Azizi, Saeed Zolfaghari:
A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling. Eur. J. Oper. Res. 177(3): 1894-1910 (2007) - [j6]Saeed Zolfaghari, Ahmed W. El-Bouri, Banafsheh Namiranian, Vinh Quan:
Heuristics for Large Scale Labour Scheduling Problems in Retail Sector. INFOR Inf. Syst. Oper. Res. 45(3): 111-122 (2007) - [c1]Nader Azizi, Saeed Zolfaghari, Ming Liang:
A New Meta-heuristic Approach for Combinatorial Optimization and Scheduling Problems. CISched 2007: 7-14 - 2004
- [j5]Saeed Zolfaghari, Ming Liang:
Erratum to "A new genetic algorithm for the machine/part grouping problem involving processing times and lot sizes" [Computers & Industrial Engineering 45 (4) (2003) 713-731]. Comput. Ind. Eng. 46(3): 589 (2004) - [j4]Nader Azizi, Saeed Zolfaghari:
Adaptive temperature control for simulated annealing: a comparative study. Comput. Oper. Res. 31(14): 2439-2451 (2004) - 2003
- [j3]Saeed Zolfaghari, Ming Liang:
A new genetic algorithm for the machine/part grouping problem involving processing times and lot sizes. Comput. Ind. Eng. 45(4): 713-731 (2003) - 2002
- [j2]Saeed Zolfaghari, Mohamad Y. Jaber, Nader Azizi:
A Multi-Attribute Performance Measurement Model for Advanced Public Transit Systems. J. Intell. Transp. Syst. 7(3-4): 295-314 (2002)
1990 – 1999
- 1999
- [j1]Ming Liang, Saeed Zolfaghari:
Machine cell formation considering processing times and machine capacities: An ortho-synapse Hopfield neural network approach. J. Intell. Manuf. 10(5): 437-447 (1999)
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-04-25 05:48 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:
