![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Dipak Laha
Person information
Refine list
![note](https://dblp.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
- [j14]Ankan Bose, Dipak Laha:
Efficient clustering-based constructive heuristics for capacitated vehicle routing. Int. J. Math. Oper. Res. 27(4): 458-478 (2024) - 2020
- [j13]Jatinder N. D. Gupta
, Arindam Majumder, Dipak Laha:
Flowshop scheduling with artificial neural networks. J. Oper. Res. Soc. 71(10): 1619-1637 (2020)
2010 – 2019
- 2019
- [j12]Arindam Majumder, Dipak Laha, Ponnuthurai N. Suganthan:
Bacterial foraging optimization algorithm in robotic cells with sequence-dependent setup times. Knowl. Based Syst. 172: 104-122 (2019) - 2018
- [j11]Arindam Majumder, Dipak Laha, Ponnuthurai N. Suganthan:
A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times. Comput. Ind. Eng. 124: 65-76 (2018) - [j10]Dipak Laha
, Jatinder N. D. Gupta
:
An improved cuckoo search algorithm for scheduling jobs on identical parallel machines. Comput. Ind. Eng. 126: 348-360 (2018) - 2017
- [j9]Dipak Laha, Dhiren Kumar Behera
:
A comprehensive review and evaluation of LPT, MULTIFIT, COMBINE and LISTFIT for scheduling identical parallel machines. Int. J. Inf. Commun. Technol. 11(2): 151-165 (2017) - 2016
- [j8]Dipak Laha, Jatinder N. D. Gupta
:
A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops. Comput. Ind. Eng. 98: 373-383 (2016) - [j7]Arindam Majumder, Dipak Laha
:
A new cuckoo search algorithm for 2-machine robotic cell scheduling problem with sequence-dependent setup times. Swarm Evol. Comput. 28: 131-143 (2016) - 2015
- [j6]Dipak Laha, Ren Ye, Ponnuthurai N. Suganthan
:
Modeling of steelmaking process with effective machine learning techniques. Expert Syst. Appl. 42(10): 4687-4696 (2015) - 2014
- [j5]Dipak Laha, Sagar U. Sapkal:
An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop. Comput. Ind. Eng. 67: 36-43 (2014) - [j4]Dipak Laha, Jatinder N. D. Gupta
, Sagar U. Sapkal:
A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops. J. Oper. Res. Soc. 65(10): 1611-1624 (2014) - [c6]Dipak Laha, Dhiren Kumar Behera
:
An Improved Cuckoo Search Algorithm for Parallel Machine Scheduling. SEMCCO 2014: 788-800 - 2013
- [c5]Dipak Laha, Dhiren Kumar Behera
:
Improved Flow Shop Schedules with Total Completion Time Criterion. ICCSA (3) 2013: 258-270 - [c4]Arindam Chakravorty, Dipak Laha:
A Hybrid Algorithm for the Permutation Flow Shop Scheduling Problem. PReMI 2013: 745-750 - [c3]Dipak Laha:
ANN Modeling of a Steelmaking Process. SEMCCO (2) 2013: 308-318 - 2012
- [c2]Dipak Laha:
A Simulated Annealing Heuristic for Minimizing Makespan in Parallel Machine Scheduling. SEMCCO 2012: 198-205 - 2010
- [j3]Dipak Laha, Uday Kumar Chakraborty:
Minimising total flow time in permutation flow shop scheduling using a simulated annealing-based approach. Int. J. Autom. Control. 4(4): 359-379 (2010)
2000 – 2009
- 2007
- [j2]Dipak Laha, Uday K. Chakraborty:
An efficient stochastic hybrid heuristic for flowshop scheduling. Eng. Appl. Artif. Intell. 20(6): 851-856 (2007) - [j1]Uday Kumar Chakraborty, Dipak Laha:
An improved heuristic for permutation flowshop scheduling. Int. J. Inf. Commun. Technol. 1(1): 89-97 (2007) - [c1]Dipak Laha, Debiprasad Bandyopadhyay:
A Constructive Heuristic for No-wait Flowshop Scheduling. IICAI 2007: 43-48
Coauthor Index
![](https://dblp.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-07-27 17:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint