The following pages link to Jatinder N. D. Gupta (Q195300):
Displaying 42 items.
- (Q2781964) (← links)
- Scheduling Identical Parallel Machines with a Fixed Number of Delivery Dates (Q2806964) (← links)
- FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES (Q3028706) (← links)
- Two-machine open shop scheduling with secondary criteria (Q3044040) (← links)
- Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times (Q3055422) (← links)
- Minimising makespan in the two-machine flow-shop with release times (Q3157644) (← links)
- Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups (Q3163328) (← links)
- (Q3436602) (← links)
- Single machine scheduling with sequence-dependent family setups to minimize maximum lateness (Q3585727) (← links)
- Two-Stage, Hybrid Flowshop Scheduling Problem (Q3780742) (← links)
- A flow-shop problem with sequence-dependent additive setup times (Q3806968) (← links)
- Analysis of a Combinatorial Approach to Flowshop Scheduling Problems (Q4055397) (← links)
- (Q4091699) (← links)
- Optimal flowshop schedules with no intermediate storage space (Q4094642) (← links)
- (Q4099409) (← links)
- Optimal schedules for special structure flowshops (Q4103319) (← links)
- (Q4133367) (← links)
- Technical Note—Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem (Q4154350) (← links)
- Minimizing tardy jobs in a two-stage hybrid flowshop (Q4245656) (← links)
- A flowshop scheduling problem with two operations per job (Q4252108) (← links)
- Two-machine flowshop scheduling to minimize the number of tardy jobs (Q4367035) (← links)
- Selecting Scheduling Heuristics Using Neural Networks (Q4427328) (← links)
- Insights into two solution procedures for the single machine tardiness problem (Q4656685) (← links)
- Maintenance policies for a production system with constrained production rate and buffer capacity (Q4671236) (← links)
- Comparative evaluation of MILP flowshop models (Q4671552) (← links)
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective (Q4678194) (← links)
- (Q4772962) (← links)
- A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times (Q4896692) (← links)
- Incorporating preventive maintenance into the <i>m</i>-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study (Q5058979) (← links)
- Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities (Q5059237) (← links)
- Minimizing flowtime subject to optimal makespan on two identical parallel machines (Q5189089) (← links)
- Minimizing flow time in a flow-line manufacturing cell with family setup times (Q5200787) (← links)
- Supply Chain Coordination with a Risk-Averse Retailer and a Combined Buy-Back and Revenue Sharing Contract (Q5241282) (← links)
- Single machine group scheduling with family setups to minimize total tardiness (Q5385473) (← links)
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times (Q5477730) (← links)
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem (Q5619726) (← links)
- Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem (Q5635251) (← links)
- (Q5650198) (← links)
- (Q5684823) (← links)
- Minimizing makespan subject to minimum flowtime on two identical parallel machines (Q5939974) (← links)
- Comparative evaluation of genetic algorithm and backpropagation for training neural networks (Q5946280) (← links)
- Local search heuristics for two-stage flow shop problems with secondary criterion (Q5955475) (← links)
