default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJatinder N. D. Gupta
- > Home > Persons > Jatinder N. D. Gupta
Publications
- 2023
[j105]Ming He, Qiuhua Tang
, Jatinder N. D. Gupta, Zikai Zhang, Jun Cao:
Robust scheduling of EMU first-level maintenance in a stub-end depot under stochastic uncertainties. Eng. Appl. Artif. Intell. 123(Part C): 106398 (2023)- [c9]Fouad Medouar, Abdelhak Elidrissi, Rachid Benmansour, Jatinder N. D. Gupta:
No-Wait Two-Machine Permutation Flow Shop Scheduling Problem with a Single Server and Separable Setup Times to Minimize Total Tardiness. CoDIT 2023: 626-631 - 2022
- [j103]Vincent F. Yu, Meng Qiu, Jatinder N. D. Gupta:
Improving supplier capability through training: Evidence from the Chinese Automobile Industry. Comput. Ind. Eng. 163: 107825 (2022) - [j102]Chunhao Li, Feng Wang, Jatinder N. D. Gupta, Tsui-Ping Chung:
Scheduling identical parallel batch processing machines involving incompatible families with different job sizes and capacity constraints. Comput. Ind. Eng. 169: 108115 (2022) - [j101]Chuanhui Xiong, Anna G. Devlin, Jatinder N. D. Gupta, Xiangrong Liu:
Effect of price reduction on renewable energy technology supply chain performance and contract design. J. Oper. Res. Soc. 73(4): 822-839 (2022) - 2021
- [j100]Vincent F. Yu, Meng Qiu, He Pan, Tsui-Ping Chung, Jatinder N. D. Gupta:
An Improved Immunoglobulin-Based Artificial Immune System for the Aircraft Scheduling Problem With Alternate Aircrafts. IEEE Access 9: 16532-16545 (2021) - 2019
- [j96]Han Zhao, Shiji Song, Yuli Zhang, Jatinder N. D. Gupta, Anna G. Devlin:
Optimal Decisions of a Supply Chain With a Risk-Averse Retailer and Portfolio Contracts. IEEE Access 7: 123877-123892 (2019) - [j95]Han Zhao, Shiji Song, Yuli Zhang, Jatinder N. D. Gupta, Anna G. Devlin, Raymond Chiong:
Supply Chain Coordination with a Risk-Averse Retailer and a Combined Buy-Back and Revenue Sharing Contract. Asia Pac. J. Oper. Res. 36(5): 1950028:1-1950028:23 (2019) - [j93]Tsui-Ping Chung, Jatinder N. D. Gupta, Haidan Zhao, Frank Werner:
Minimizing the makespan on two identical parallel machines with mold constraints. Comput. Oper. Res. 105: 141-155 (2019) - 2018
- [j91]Fan Yue, Shiji Song, Yuli Zhang, Jatinder N. D. Gupta, Raymond Chiong:
Robust single machine scheduling with uncertain release times for minimising the maximum waiting time. Int. J. Prod. Res. 56(16): 5576-5592 (2018) - 2016
- [j84]Zhicheng Cai, Xiaoping Li, Jatinder N. D. Gupta:
Heuristics for Provisioning Services to Workflows in XaaS Clouds. IEEE Trans. Serv. Comput. 9(2): 250-263 (2016) - 2015
- [j83]Jianya Ding, Shiji Song, Jatinder N. D. Gupta, Rui Zhang, Raymond Chiong, Cheng Wu:
An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Appl. Soft Comput. 30: 604-613 (2015) - [j80]Yazhi Li, Xiaoping Li, Jatinder N. D. Gupta:
Solving the multi-objective flowline manufacturing cell scheduling problem by hybrid harmony search. Expert Syst. Appl. 42(3): 1409-1417 (2015) - 2014
- [j76]Gao Huang, Shiji Song, Jatinder N. D. Gupta, Cheng Wu:
Semi-Supervised and Unsupervised Extreme Learning Machines. IEEE Trans. Cybern. 44(12): 2405-2417 (2014) - 2013
- [j75]Gao Huang, Shiji Song, Jatinder N. D. Gupta, Cheng Wu:
A second order cone programming approach for semi-supervised learning. Pattern Recognit. 46(12): 3548-3558 (2013) - [c6]Zhicheng Cai, Xiaoping Li, Long Chen, Jatinder N. D. Gupta:
Bi-direction Adjust Heuristic for Workflow Scheduling in Clouds. ICPADS 2013: 94-101 - [c5]Zhicheng Cai, Xiaoping Li, Jatinder N. D. Gupta:
Critical Path-Based Iterative Heuristic for Workflow Scheduling in Utility and Cloud Computing. ICSOC 2013: 207-221 - 2012
- [j74]Cheng Wang, Shiji Song, Jatinder N. D. Gupta, Cheng Wu:
A three-phase algorithm for flowshop scheduling with blocking to minimize makespan. Comput. Oper. Res. 39(11): 2880-2887 (2012) - 2010
- [j73]Feng Jin, Jatinder N. D. Gupta, Shiji Song, Cheng Wu:
Single machine scheduling with sequence-dependent family setups to minimize maximum lateness. J. Oper. Res. Soc. 61(7): 1181-1189 (2010) - 2008
- [j70]U. V. Manoj, Jatinder N. D. Gupta, Sushil K. Gupta, Chelliah Sriskandarajah:
Supply chain scheduling: Just-in-time environment. Ann. Oper. Res. 161(1): 53-86 (2008) - [j67]Feng Jin, Jatinder N. D. Gupta, Shiji Song, Cheng Wu:
Makespan distribution of permutation flowshop schedules. J. Sched. 11(6): 421-432 (2008) - 2006
- [j62]Tapan P. Bagchi, Jatinder N. D. Gupta, Chelliah Sriskandarajah:
A review of TSP based approaches for flowshop scheduling. Eur. J. Oper. Res. 169(3): 816-854 (2006) - [j61]Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis:
Performance guarantees for flowshop heuristics to minimize makespan. Eur. J. Oper. Res. 169(3): 865-872 (2006) - 2005
- [j57]Klaus H. Ecker, Jatinder N. D. Gupta:
Scheduling tasks on a flexible manufacturing machine to minimize tool change delays. Eur. J. Oper. Res. 164(3): 627-638 (2005) - 2004
- [j49]Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich:
Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan. Ann. Oper. Res. 129(1-4): 171-185 (2004) - [j45]Jatinder N. D. Gupta, Volker Lauff, Frank Werner:
Two-Machine Flow Shop Scheduling with Nonregular Criteria. J. Math. Model. Algorithms 3(2): 123-151 (2004) - 2003
- [j41]Vincent T'kindt, Jatinder N. D. Gupta, Jean-Charles Billaut:
Two-machine flowshop scheduling with a secondary criterion. Comput. Oper. Res. 30(4): 505-526 (2003) - 2002
- [j38]Jatinder N. D. Gupta, Karsten Hennig, Frank Werner:
Local search heuristics for two-stage flow shop problems with secondary criterion. Comput. Oper. Res. 29(2): 123-149 (2002) - [j37]Jatinder N. D. Gupta, Karin Krüger, Volker Lauff, Frank Werner, Yuri N. Sotskov:
Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput. Oper. Res. 29(10): 1417-1439 (2002) - 2000
- [j31]Federico Della Croce, Jatinder N. D. Gupta, Roberto Tadei:
Minimizing tardy jobs in a flowshop with common due date. Eur. J. Oper. Res. 120(2): 375-381 (2000) - 1999
- [j24]Jatinder N. D. Gupta, A. M. A. Hariri, Chris N. Potts:
Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs. Ann. Oper. Res. 92: 107-123 (1999) - [j23]Celia A. Glass, Jatinder N. D. Gupta, Chris N. Potts:
Two-Machine No-Wait Flow Shop Scheduling with Missing Operations. Math. Oper. Res. 24(4): 911-924 (1999) - 1998
- [j22]Roberto Tadei, Jatinder N. D. Gupta, Federico Della Croce, M. Cortesi:
Minimising makespan in the two-machine flow-shop with release times. J. Oper. Res. Soc. 49(1): 77-85 (1998) - 1997
- [j21]Jatinder N. D. Gupta, A. M. A. Hariri, Chris N. Potts:
Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Ann. Oper. Res. 69: 171-191 (1997) - [j18]Jatinder N. D. Gupta, Vitaly A. Strusevich, Carin M. Zwaneveld:
Two-stage no-wait scheduling models with setup and removal times separated. Comput. Oper. Res. 24(11): 1025-1031 (1997)
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-21 21:33 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:
