![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Mostafa Khatami
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Mostafa Khatami
, Amir Salehipour
:
The coupled task scheduling problem: an improved mathematical program and a new solution algorithm. Int. Trans. Oper. Res. 31(4): 2399-2426 (2024) - [j9]Mostafa Khatami
, Daniel Oron, Amir Salehipour
:
Scheduling coupled tasks on parallel identical machines. Optim. Lett. 18(4): 991-1003 (2024) - 2023
- [j8]Mostafa Khatami
, Amir Salehipour
, T. C. E. Cheng
:
Flow-shop scheduling with exact delays to minimize makespan. Comput. Ind. Eng. 183: 109456 (2023) - [j7]Mostafa Khatami
, Amir Salehipour
:
The gradual minimum covering location problem. J. Oper. Res. Soc. 74(4): 1092-1104 (2023) - 2021
- [j6]Mostafa Khatami
, Amir Salehipour
:
A binary search algorithm for the general coupled task scheduling problem. 4OR 19(4): 593-611 (2021) - [j5]Mohammad Mahdi Ahmadian
, Mostafa Khatami
, Amir Salehipour
, T. C. E. Cheng:
Four decades of research on the open-shop scheduling problem to minimize the makespan. Eur. J. Oper. Res. 295(2): 399-426 (2021) - [j4]Mostafa Khatami
, Amir Salehipour
:
Coupled task scheduling with time-dependent processing times. J. Sched. 24(2): 223-236 (2021) - 2020
- [j3]Mostafa Khatami
, Amir Salehipour
, T. C. E. Cheng
:
Coupled task scheduling with exact delays: Literature review and models. Eur. J. Oper. Res. 282(1): 19-39 (2020) - [c1]Mostafa Khatami
, Amir Salehipour:
A Relax-and-Solve Algorithm for the Ordered Flow-Shop Scheduling Problem. IEEM 2020: 1147-1151
2010 – 2019
- 2019
- [j2]Mostafa Khatami
, Amir Salehipour
, F. J. Hwang
:
Makespan minimization for the m-machine ordered flow shop scheduling problem. Comput. Oper. Res. 111: 400-414 (2019) - 2017
- [j1]Mostafa Khatami
, Seyed Hessameddin Zegordi:
Coordinative production and maintenance scheduling problem with flexible maintenance time intervals. J. Intell. Manuf. 28(4): 857-867 (2017)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-10 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint