Остановите войну!
for scientists:
default search action
Jatinder N. D. Gupta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j106]Jatinder N. D. Gupta, Chin-Chia Wu, Win-Chin Lin, Xingong Zhang, Danyu Bai, Bertrand M. T. Lin, Chia-Cheng Liao:
Bicriteria single-machine scheduling with multiple job classes and customer orders. Appl. Soft Comput. 147: 110809 (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) - [j104]Hugo Hissashi Miyata, Marcelo Seido Nagano, Jatinder N. D. Gupta:
Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function. Int. J. Prod. Res. 61(19): 6308-6335 (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) - [j99]Chin-Chia Wu, Jatinder N. D. Gupta, Shuenn-Ren Cheng, Bertrand M. T. Lin, Siu-Hung Yip, Win-Chin Lin:
Robust scheduling for a two-stage assembly shop with scenario-dependent processing times. Int. J. Prod. Res. 59(17): 5372-5387 (2021) - 2020
- [j98]Shijin Wang, Wenli Cui, Feng Chu, Jianbo Yu, Jatinder N. D. Gupta:
Robust (min-max regret) single machine scheduling with interval processing times and total tardiness criterion. Comput. Ind. Eng. 149: 106838 (2020) - [j97]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
- [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) - [j94]Hugo Hissashi Miyata, Marcelo Seido Nagano, Jatinder N. D. Gupta:
Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Comput. Ind. Eng. 135: 79-104 (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) - [c8]Jatinder N. D. Gupta, Ezhil Kalaimannan, Seong-Moo Yoo:
A Sequential Investigation Model for Solving Time Critical Digital Forensic Cases Involving a Single Investigator. NCS 2019: 202-219 - 2018
- [j92]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) - [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) - [j90]Liji Shen, Jatinder N. D. Gupta:
Family scheduling with batch availability in flow shops to minimize makespan. J. Sched. 21(2): 235-249 (2018) - 2017
- [j89]Ezhil Kalaimannan, Jatinder N. D. Gupta:
The Security Development Lifecycle in the Context of Accreditation Policies and Standards. IEEE Secur. Priv. 15(1): 52-57 (2017) - [j88]Bertrand M. T. Lin, F. J. Hwang, Jatinder N. D. Gupta:
Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence. J. Sched. 20(3): 293-302 (2017) - 2016
- [j87]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) - [j86]Jatinder N. D. Gupta, Ezhil Kalaimannan, Seong-Moo Yoo:
A heuristic for maximizing investigation effectiveness of digital forensic cases involving multiple investigators. Comput. Oper. Res. 69: 1-9 (2016) - [j85]Janis Sebastian Neufeld, Jatinder N. D. Gupta, Udo Buscher:
A comprehensive review of flowshop group scheduling literature. Comput. Oper. Res. 70: 56-74 (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) - [j82]Jing Xiao, Huasheng Yang, Canrong Zhang, Li Zheng, Jatinder N. D. Gupta:
A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 63: 72-82 (2015) - [j81]Arne Mensendiek, Jatinder N. D. Gupta, Jan Herrmann:
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness. Eur. J. Oper. Res. 243(2): 514-522 (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
- [j79]Yejun Xu, Jatinder N. D. Gupta, Huimin Wang:
The ordinal consistency of an incomplete reciprocal preference relation. Fuzzy Sets Syst. 246: 62-77 (2014) - [j78]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) - [j77]Liji Shen, Jatinder N. D. Gupta, Udo Buscher:
Flow shop batching and scheduling with sequence-dependent setup times. J. Sched. 17(4): 353-370 (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) - [c7]Arne Mensendiek, Jatinder N. D. Gupta:
Scheduling Identical Parallel Machines with a Fixed Number of Delivery Dates. OR 2014: 393-398 - 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 - [c4]Ezhil Kalaimannan, Jatinder N. D. Gupta, Seong-Moo Yoo:
Maximizing Investigation Effectiveness in Digital Forensic Cases. SocialCom 2013: 618-623 - 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)
2000 – 2009
- 2009
- [j72]Gloria E. Phillips-Wren, Manuel Mora, Guisseppi A. Forgionne, Jatinder N. D. Gupta:
An integrative evaluation framework for intelligent decision support systems. Eur. J. Oper. Res. 195(3): 642-652 (2009) - [j71]Cynthia R. Lovelace, James J. Swain, Hisham Zeinelabdin, Jatinder N. D. Gupta:
Lower confidence limits for process capability indices Cp and Cpk when data are autocorrelated. Qual. Reliab. Eng. Int. 25(6): 663-700 (2009) - 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) - [j69]Jeffrey E. Schaller, Jatinder N. D. Gupta:
Single machine scheduling with family setups to minimize total earliness and tardiness. Eur. J. Oper. Res. 187(3): 1050-1068 (2008) - [j68]S. Raut, Jatinder N. D. Gupta, S. Swami:
Single machine scheduling with time deteriorating job values. J. Oper. Res. Soc. 59(1): 105-118 (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) - 2007
- [j66]Alberto Caldelas-Lopez, Joan A. Pastor, Jatinder N. D. Gupta:
An initial research agenda for SCM information systems. Int. J. Netw. Virtual Organisations 4(2): 180-188 (2007) - 2006
- [j65]Sushil K. Sharma, Jatinder N. D. Gupta, Nilmini Wickramasinghe:
A framework for designing the enterprise-wide e-commerce portal for evolving organizations. Electron. Commer. Res. 6(2): 141-154 (2006) - [j64]Xiaotong Li, Jatinder N. D. Gupta, James V. Koch:
Effect of technological breakthroughs on electronic markets. Electron. Commer. Res. 6(3-4): 389-404 (2006) - [j63]Jatinder N. D. Gupta, Edward F. Stafford:
Flowshop scheduling research after five decades. Eur. J. Oper. Res. 169(3): 699-711 (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) - [j60]Jatinder N. D. Gupta, Jeffrey E. Schaller:
Minimizing flow time in a flow-line manufacturing cell with family setup times. J. Oper. Res. Soc. 57(2): 163-176 (2006) - [j59]Fan T. Tseng, Jatinder N. D. Gupta, Edward F. Stafford Jr.:
A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times. J. Oper. Res. Soc. 57(5): 541-551 (2006) - 2005
- [j58]Paulo Morelato França, Jatinder N. D. Gupta, Alexandre Mendes, Pablo Moscato, Klaas J. Veltink:
Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Comput. Ind. Eng. 48(3): 491-506 (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) - [j56]Jatinder N. D. Gupta, Alex J. Ruiz-Torres:
Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs. Eur. J. Oper. Res. 167(3): 679-695 (2005) - [j55]Ganesh D. Bhatt, Jatinder N. D. Gupta:
Interactive patterns of knowledge management in organisations: insight from a fashion company. Int. J. Inf. Technol. Manag. 4(3): 231-243 (2005) - [j54]Manuel Mora, Guisseppi A. Forgionne, Jatinder N. D. Gupta, Francisco Cervantes-Pérez, Ovsei Gelman:
Intelligent Decision-Making Support Systems. A Strategic Research Agenda. J. Decis. Syst. 14(1-2): 179-196 (2005) - [j53]Manuel Mora, Guisseppi A. Forgionne, Francisco Cervantes-Pérez, Leonardo Garrido, Jatinder N. D. Gupta, Ovsei Gelman:
Toward a Comprehensive Framework for the Design and Evaluation of Intelligent Decision-making Support Systems (i-DMSS). J. Decis. Syst. 14(3): 321-344 (2005) - [j52]Ganesh D. Bhatt, Jatinder N. D. Gupta, Fred L. Kitchens:
An exploratory study of groupware use in the knowledge management process. J. Enterp. Inf. Manag. 18(1): 28-46 (2005) - [j51]Edward F. Stafford Jr., Fan T. Tseng, Jatinder N. D. Gupta:
Comparative evaluation of MILP flowshop models. J. Oper. Res. Soc. 56(1): 88-101 (2005) - [j50]Jose M. Framiñan, Jatinder N. D. Gupta, Rainer Leisten:
A review and classification of heuristics for permutation flow-stop scheduling with makespan objective. J. Oper. Res. Soc. 56(3): 351 (2005) - [r3]Guisseppi A. Forgionne, Manuel Mora, Jatinder N. D. Gupta, Ovsei Gelman:
Decision-Making Support Systems. Encyclopedia of Information Science and Technology (II) 2005: 759-765 - [r2]Nory B. Jones, Jatinder N. D. Gupta:
Small Busines Transformation Through Knowledge Management. Encyclopedia of Information Science and Technology (V) 2005: 2514-2518 - [r1]Sushil K. Sharma, Nilmini Wickramasinghe, Jatinder N. D. Gupta:
SMEs in Knowledge-Based Economies. Encyclopedia of Information Science and Technology (V) 2005: 2523-2528 - 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) - [j48]Sushil K. Sharma, Jatinder N. D. Gupta:
Web services architecture for m-government: issues and challenges. Electron. Gov. an Int. J. 1(4): 462-474 (2004) - [j47]Adolfo Crespo Marquez, Carmine Bianchi, Jatinder N. D. Gupta:
Operational and financial effectiveness of e-collaboration tools in supply chain integration. Eur. J. Oper. Res. 159(2): 348-363 (2004) - [j46]Sushil K. Sharma, Jatinder N. D. Gupta:
Improving Workers' Productivity and Reducing Internet Abuse. J. Comput. Inf. Syst. 44(2): 74-78 (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) - [j44]Jose M. Framiñan, Jatinder N. D. Gupta, Rainer Leisten:
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J. Oper. Res. Soc. 55(12): 1243-1255 (2004) - [j43]S. R. Das, Jatinder N. D. Gupta, Basheer M. Khumawala:
A savings index heuristic algorithm for flowshop scheduling with sequence-dependent setup times. J. Oper. Res. Soc. 55(12): 1369 (2004) - [j42]Jatinder N. D. Gupta, Mohammed Quaddus, Robert D. Galliers:
Strategic Information Systems in the Post-Net Era. J. Strateg. Inf. Syst. 13(2): 87-89 (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) - [j40]Sushil K. Sharma, Jatinder N. D. Gupta:
Building Blocks of an E-Government: A Framework. J. Electron. Commer. Organ. 1(4): 34-48 (2003) - [j39]Jatinder N. D. Gupta, Alex J. Ruiz-Torres, Scott Webster:
Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time. J. Oper. Res. Soc. 54(12): 1263-1274 (2003) - [c3]Manuel Mora T., Guisseppi A. Forgionne, Jatinder N. D. Gupta, Francisco Cervantes-Pérez, Ovsei Gelman:
A Framework to Assess Intelligent Decision-Making Support Systems. KES 2003: 59-65 - 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) - [j36]Guisseppi A. Forgionne, Jatinder N. D. Gupta, Manuel Mora:
Editorial. J. Decis. Syst. 11(2): 127-130 (2002) - [j35]Rajiv Kohli, Jatinder N. D. Gupta:
Effectiveness of Systems Analysis and Design Education: An Exploratory Study. J. Organ. End User Comput. 14(3): 16-31 (2002) - [j34]Jaideep T. Naidu, Jatinder N. D. Gupta, Bahram Alidaee:
Insights into two solution procedures for the single machine tardiness problem. J. Oper. Res. Soc. 53(7): 800-806 (2002) - [p1]Jatinder N. D. Gupta, Sushil K. Sharma:
Globalization and Information Management Strategy. Encyclopedia of Information Systems 2002: 475-487 - 2001
- [j33]Jatinder N. D. Gupta, Johnny C. Ho:
Minimizing makespan subject to minimum flowtime on two identical parallel machines. Comput. Oper. Res. 28(7): 705-717 (2001) - [c2]Kate A. Smith, Jatinder N. D. Gupta:
Continuous Function Optimisation via Gradient Descent on a Neural Network Approximation Function. IWANN (1) 2001: 741-748 - [c1]In Lee, Jatinder N. D. Gupta, Amar D. Amar:
A multi-neural-network learning for lot sizing and sequencing on a flow-shop. SAC 2001: 36-40 - 2000
- [j32]Kate A. Smith, Jatinder N. D. Gupta:
Neural networks in business: techniques and applications for the operations researcher. Comput. Oper. Res. 27(11-12): 1023-1044 (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) - [j30]Jeffrey E. Schaller, Jatinder N. D. Gupta, Asoo J. Vakharia:
Scheduling a flowline manufacturing cell with sequence dependent family setup times. Eur. J. Oper. Res. 125(2): 324-339 (2000) - [j29]Jatinder N. D. Gupta, Alex J. Ruiz-Torres:
Minimizing makespan subject to minimum total flow-time on identical parallel machines. Eur. J. Oper. Res. 125(2): 370-380 (2000) - [j28]Renee M. Wachter, Jatinder N. D. Gupta, Mohammed A. Quaddus:
IT takes a village: Virtual communities in support of education. Int. J. Inf. Manag. 20(6): 473-489 (2000) - [j27]Jatinder N. D. Gupta, Randall S. Sexton, Enar A. Tunc:
Selecting Scheduling Heuristics Using Neural Networks. INFORMS J. Comput. 12(2): 150-162 (2000) - [j26]Randall S. Sexton, Jatinder N. D. Gupta:
Comparative evaluation of genetic algorithm and backpropagation for training neural networks. Inf. Sci. 129(1-4): 45-59 (2000) - [j25]Jatinder N. D. Gupta, Johnny C. Ho, Scott Webster:
Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines. J. Oper. Res. Soc. 51(11): 1330-1339 (2000)
1990 – 1999
- 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) - [j20]Jatinder N. D. Gupta, Johnny C. Ho, Jack A. A. van der Veen:
Single machine hierarchical scheduling with customer orders and multiple job classes. Ann. Oper. Res. 70: 127-143 (1997) - [j19]Renee M. Wachter, Jatinder N. D. Gupta:
Distance education and the use of computers as instructional tools for systems development projects: A case study of the construction of expert systems. Comput. Educ. 29(1): 13-23 (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) - [j17]Jay B. Ghosh, Jatinder N. D. Gupta:
Batch scheduling to minimize maximum lateness. Oper. Res. Lett. 21(2): 77-80 (1997) - 1996
- [j16]Jatinder N. D. Gupta:
Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags. J. Glob. Optim. 9(3-4): 239-253 (1996) - 1995
- [j15]Johnny C. Ho, Jatinder N. D. Gupta:
Flowshop scheduling with dominant machines. Comput. Oper. Res. 22(2): 237-246 (1995) - [j14]Jan Riezebos, Gerard J. C. Gaalman, Jatinder N. D. Gupta:
Flow shop scheduling with multiple operations and time lags. J. Intell. Manuf. 6(2): 105-115 (1995)
1980 – 1989
- 1989
- [j13]Tapan Sen, Parthasarati Dileepan, Jatinder N. D. Gupta:
The two-machine flowshop scheduling problem with total tardiness. Comput. Oper. Res. 16(4): 333-340 (1989) - [j12]Jatinder N. D. Gupta, Irmtraud S. Seeborg:
The Graduate MIS Course in the Schools and Colleges of Business. J. Manag. Inf. Syst. 5(4): 125-136 (1989) - 1987
- [j11]Jatinder N. D. Gupta, J. George Shanthikumar, Wlodzimierz Szwarc:
Generating improved dominance conditions for the flowshop problem. Comput. Oper. Res. 14(1): 41-45 (1987) - [j10]Harish C. Bahl, Larry P. Ritzman, Jatinder N. D. Gupta:
OR Practice - Determining Lot Sizes and Resource Requirements: A Review. Oper. Res. 35(3): 329-345 (1987) - 1986
- [j9]David F. Dianich, Jatinder N. D. Gupta:
Polynomial approximation technique for dynamic optimization problems. Comput. Oper. Res. 13(4): 437-442 (1986) - 1984
- [j8]Jatinder N. D. Gupta:
Optimal schedules for single facility with two job classes. Comput. Oper. Res. 11(4): 409-413 (1984)
1970 – 1979
- 1979
- [j7]Jatinder N. D. Gupta:
An improved lexicographic search algorithm for the flowshop scheduling problem. Comput. Oper. Res. 6(2): 117-120 (1979) - 1978
- [j6]Jatinder N. D. Gupta:
A search algorithm for the traveling salesman problem. Comput. Oper. Res. 5(4): 243-250 (1978) - [j5]Jatinder N. D. Gupta, S. S. Reddi:
Technical Note - Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem. Oper. Res. 26(1): 200-203 (1978) - 1977
- [j4]Jatinder N. D. Gupta:
Introduction to the special postal issue. Comput. Oper. Res. 4(4): 233-234 (1977) - [j3]Jatinder N. D. Gupta, LeRoy J. Krajewski:
Operations research in postal services - a survey. Comput. Oper. Res. 4(4): 235-246 (1977) - 1975
- [j2]Jatinder N. D. Gupta:
A search algorithm for the generalized flowshop scheduling problem. Comput. Oper. Res. 2(2): 83-90 (1975) - 1971
- [j1]Jatinder N. D. Gupta:
Technical Note - An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem. Oper. Res. 19(7): 1753-1758 (1971)
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-08-05 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint