Jatinder Gupta | University of Alabama in Huntsville (original) (raw)

Papers by Jatinder Gupta

Research paper thumbnail of Robust scheduling of EMU first-level maintenance in a stub-end depot under stochastic uncertainties

Engineering Applications of Artificial Intelligence

Research paper thumbnail of Designing a Production Control System for FMS

Proceeding of Flexible Automation and Integrated Manufacturing 1994

Research paper thumbnail of Sustainable microgrid design with peer-to-peer energy trading involving government subsidies and uncertainties

Research paper thumbnail of Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function

International Journal of Production Research

Research paper thumbnail of The shunting scheduling of EMU first-level maintenance in a stub-end depot

Flexible Services and Manufacturing Journal

Research paper thumbnail of Sustainable microgrid design with multiple demand areas and peer-to-peer energy trading involving seasonal factors and uncertainties

Renewable and Sustainable Energy Reviews

Research paper thumbnail of An Economic Evaluation of Postal Operations

Journal of Parametrics, 1984

Research paper thumbnail of A Sequential Investigation Model for Solving Time Critical Digital Forensic Cases Involving a Single Investigator

The number of evidences found in a digital crime scene has burgeoned significantly over the past ... more The number of evidences found in a digital crime scene has burgeoned significantly over the past few years. In addition, the demand for delivering accurate results within a given time deadline has increased. The major challenges coinciding with these aforementioned objectives are to investigate the right set of evidences and to allocate appropriate times for their investigation. In this paper, we present a mixed integer linear programming (MILP) model to analyze the problem of allocating optimal investigation times for evidences involving a single investigator. The objective is to maximize the overall effectiveness of a forensic investigation procedure. We particularly focus on the time critical digital forensic cases, in which results have to be finalized in a court of law within a specified time deadline. While the general problem is NP-hard, two special cases are illustrated to be optimally solvable in polynomially computational effort. Two heuristic algorithms are proposed to so...

Research paper thumbnail of An Appraisal of Postal Pricing Policies

Journal of Parametrics, 1985

Research paper thumbnail of Improving supplier capability through training: Evidence from the Chinese Automobile Industry

Computers & Industrial Engineering, 2021

Research paper thumbnail of Statistical Information Systems for Management

Journal of Parametrics, 1985

Research paper thumbnail of Flowshop scheduling with artificial neural networks

Journal of the Operational Research Society, 2019

Research paper thumbnail of Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization

Computers & Industrial Engineering, 2019

Research paper thumbnail of Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study

Engineering Optimization, 2018

Research paper thumbnail of An improved cuckoo search algorithm for scheduling jobs on identical parallel machines

Computers & Industrial Engineering, 2018

Research paper thumbnail of Minimising makespan in flowshop group scheduling with sequence-dependent family set-up times using inserted idle times

International Journal of Production Research, 2014

ABSTRACT This paper focuses on the permutation flowshop group scheduling problem to minimise make... more ABSTRACT This paper focuses on the permutation flowshop group scheduling problem to minimise makespan, which is typically found in flowline manufacturing cells. In contrast to classical flowshop scheduling, it is characterised by a scheduling task at two levels: on the one hand, jobs within part families and on the other hand, a number of part families have to be sequenced. Integrating sequence-dependent set-up times for every changeover of families, this problem can represent practical cases. By modelling each family as a job with time lags, some specific problem characteristics of the group scheduling problem are pointed out. It is shown that generating job sequences by minimising the sum of inserted machine idle times instead of makespan on the first level of scheduling and the use of the schedule heads on the second level can lead to significant improvements for some test problems. These findings are used for the improvement of existing constructive heuristic algorithms, whose effectiveness is assessed for several test instances with sequence-dependent family set-up times.

Research paper thumbnail of Family scheduling with batch availability in flow shops to minimize makespan

Journal of Scheduling, 2017

This paper addresses a batch scheduling problem in flow shop production systems, where job famili... more This paper addresses a batch scheduling problem in flow shop production systems, where job families are formed based on setup similarities. In order to improve setup efficiency, we consider batching decisions in our solution procedure. Due to its high practical relevance, the batch availability assumption is also adopted in this study. In the presence of sequence-dependent setup times, it is proved that a permutation flow shop is generally not optimal. Therefore, our objective is to determine solutions with inconsistent batches, which essentially lead to non-permutation schedules, to minimize makespan. After examining structural properties, we develop a tabu search algorithm with multiple neighbourhood functions. Computational results confirm the remarkable benefits of batching decisions. Our algorithm also outperforms some well-known and well-performing approaches.

Research paper thumbnail of The Graduate Mis Course in the Schools and Colleges of Business

Journal of Management Information Systems, 1989

A survey of AACSB Schools and Colleges of Business that offer gradu- ate programs indicates that ... more A survey of AACSB Schools and Colleges of Business that offer gradu- ate programs indicates that even though more schools are creating indepen- dent departments of management/computer information systems, the graduate mis course is similar to the undergraduate mis course in about half of the schools and a course later in the program (with a number of prerequisites) in about half of the schools. Due to this disparity in responding schools, ?he results are mixed. The topics covered by most schools have been covered in mis courses for a number of years. More recent topics such as strategic uses of mis, end-user computing, and artificial intelligence are foreseen for the future by some respondents, but they do not appear to have made inroads into the content of the graduate mis course.

Research paper thumbnail of A comprehensive review of flowshop group scheduling literature

Computers & Operations Research, 2016

Research paper thumbnail of The Security Development Lifecycle in the Context of Accreditation Policies and Standards

IEEE Security & Privacy, 2017

Research paper thumbnail of Robust scheduling of EMU first-level maintenance in a stub-end depot under stochastic uncertainties

Engineering Applications of Artificial Intelligence

Research paper thumbnail of Designing a Production Control System for FMS

Proceeding of Flexible Automation and Integrated Manufacturing 1994

Research paper thumbnail of Sustainable microgrid design with peer-to-peer energy trading involving government subsidies and uncertainties

Research paper thumbnail of Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function

International Journal of Production Research

Research paper thumbnail of The shunting scheduling of EMU first-level maintenance in a stub-end depot

Flexible Services and Manufacturing Journal

Research paper thumbnail of Sustainable microgrid design with multiple demand areas and peer-to-peer energy trading involving seasonal factors and uncertainties

Renewable and Sustainable Energy Reviews

Research paper thumbnail of An Economic Evaluation of Postal Operations

Journal of Parametrics, 1984

Research paper thumbnail of A Sequential Investigation Model for Solving Time Critical Digital Forensic Cases Involving a Single Investigator

The number of evidences found in a digital crime scene has burgeoned significantly over the past ... more The number of evidences found in a digital crime scene has burgeoned significantly over the past few years. In addition, the demand for delivering accurate results within a given time deadline has increased. The major challenges coinciding with these aforementioned objectives are to investigate the right set of evidences and to allocate appropriate times for their investigation. In this paper, we present a mixed integer linear programming (MILP) model to analyze the problem of allocating optimal investigation times for evidences involving a single investigator. The objective is to maximize the overall effectiveness of a forensic investigation procedure. We particularly focus on the time critical digital forensic cases, in which results have to be finalized in a court of law within a specified time deadline. While the general problem is NP-hard, two special cases are illustrated to be optimally solvable in polynomially computational effort. Two heuristic algorithms are proposed to so...

Research paper thumbnail of An Appraisal of Postal Pricing Policies

Journal of Parametrics, 1985

Research paper thumbnail of Improving supplier capability through training: Evidence from the Chinese Automobile Industry

Computers & Industrial Engineering, 2021

Research paper thumbnail of Statistical Information Systems for Management

Journal of Parametrics, 1985

Research paper thumbnail of Flowshop scheduling with artificial neural networks

Journal of the Operational Research Society, 2019

Research paper thumbnail of Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization

Computers & Industrial Engineering, 2019

Research paper thumbnail of Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study

Engineering Optimization, 2018

Research paper thumbnail of An improved cuckoo search algorithm for scheduling jobs on identical parallel machines

Computers & Industrial Engineering, 2018

Research paper thumbnail of Minimising makespan in flowshop group scheduling with sequence-dependent family set-up times using inserted idle times

International Journal of Production Research, 2014

ABSTRACT This paper focuses on the permutation flowshop group scheduling problem to minimise make... more ABSTRACT This paper focuses on the permutation flowshop group scheduling problem to minimise makespan, which is typically found in flowline manufacturing cells. In contrast to classical flowshop scheduling, it is characterised by a scheduling task at two levels: on the one hand, jobs within part families and on the other hand, a number of part families have to be sequenced. Integrating sequence-dependent set-up times for every changeover of families, this problem can represent practical cases. By modelling each family as a job with time lags, some specific problem characteristics of the group scheduling problem are pointed out. It is shown that generating job sequences by minimising the sum of inserted machine idle times instead of makespan on the first level of scheduling and the use of the schedule heads on the second level can lead to significant improvements for some test problems. These findings are used for the improvement of existing constructive heuristic algorithms, whose effectiveness is assessed for several test instances with sequence-dependent family set-up times.

Research paper thumbnail of Family scheduling with batch availability in flow shops to minimize makespan

Journal of Scheduling, 2017

This paper addresses a batch scheduling problem in flow shop production systems, where job famili... more This paper addresses a batch scheduling problem in flow shop production systems, where job families are formed based on setup similarities. In order to improve setup efficiency, we consider batching decisions in our solution procedure. Due to its high practical relevance, the batch availability assumption is also adopted in this study. In the presence of sequence-dependent setup times, it is proved that a permutation flow shop is generally not optimal. Therefore, our objective is to determine solutions with inconsistent batches, which essentially lead to non-permutation schedules, to minimize makespan. After examining structural properties, we develop a tabu search algorithm with multiple neighbourhood functions. Computational results confirm the remarkable benefits of batching decisions. Our algorithm also outperforms some well-known and well-performing approaches.

Research paper thumbnail of The Graduate Mis Course in the Schools and Colleges of Business

Journal of Management Information Systems, 1989

A survey of AACSB Schools and Colleges of Business that offer gradu- ate programs indicates that ... more A survey of AACSB Schools and Colleges of Business that offer gradu- ate programs indicates that even though more schools are creating indepen- dent departments of management/computer information systems, the graduate mis course is similar to the undergraduate mis course in about half of the schools and a course later in the program (with a number of prerequisites) in about half of the schools. Due to this disparity in responding schools, ?he results are mixed. The topics covered by most schools have been covered in mis courses for a number of years. More recent topics such as strategic uses of mis, end-user computing, and artificial intelligence are foreseen for the future by some respondents, but they do not appear to have made inroads into the content of the graduate mis course.

Research paper thumbnail of A comprehensive review of flowshop group scheduling literature

Computers & Operations Research, 2016

Research paper thumbnail of The Security Development Lifecycle in the Context of Accreditation Policies and Standards

IEEE Security & Privacy, 2017