The following pages link to Jatinder N. D. Gupta (Q195300):
Displaying 50 items.
- Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (Q319136) (← links)
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times (Q342038) (← links)
- A heuristic for maximizing investigation effectiveness of digital forensic cases involving multiple investigators (Q342305) (← links)
- Flow shop batching and scheduling with sequence-dependent setup times (Q490328) (← links)
- Generating improved dominance conditions for the flowshop problem (Q580164) (← links)
- Scheduling three-operation jobs in a two-machine flow shop to minimize makespan (Q596459) (← links)
- Two-machine flow shop scheduling with nonregular criteria (Q702362) (← links)
- Makespan distribution of permutation flowshop schedules (Q835630) (← links)
- Effect of technological breakthroughs on electronic markets (Q862586) (← links)
- A second order cone programming approach for semi-supervised learning (Q898241) (← links)
- Supply chain scheduling: Just-in-time environment (Q940916) (← links)
- The two-machine sequence dependent flowshop scheduling problem (Q1081528) (← links)
- Optimal schedules for single facility with two job classes (Q1085046) (← links)
- Polynomial approximation technique for dynamic optimization problems (Q1091280) (← links)
- Single facility scheduling with multiple job classes (Q1105481) (← links)
- The two-machine flowshop scheduling problem with total tardiness (Q1115798) (← links)
- Genetic algorithms for the two-stage bicriteria flowshop problem (Q1278393) (← links)
- A framework for decision support systems of scheduling problems (Q1278979) (← links)
- (Q1331613) (redirect page) (← links)
- Lot streaming in three-stage production processes (Q1331614) (← links)
- Scheduling a two-stage hybrid flowshop with separable setup and removal times (Q1333533) (← links)
- Flowshop scheduling with dominant machines (Q1342341) (← links)
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stage (Q1357780) (← links)
- Batch scheduling to minimize maximum lateness (Q1373461) (← links)
- Two-stage no-wait scheduling models with setup and removal times separated (Q1374028) (← links)
- Single machine hierarchical scheduling with customer orders and multiple job classes (Q1374425) (← links)
- Neural networks in business: Techniques and applications for the operations researcher (Q1579010) (← links)
- Scheduling a flowline manufacturing cell with sequence dependent family setup times (Q1580980) (← links)
- Minimizing makespan subject to minimum total flow-time on identical parallel machines (Q1580983) (← links)
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates (Q1603337) (← links)
- A comprehensive review of flowshop group scheduling literature (Q1651625) (← links)
- Minimizing the makespan on two identical parallel machines with mold constraints (Q1722974) (← links)
- Family scheduling with batch availability in flow shops to minimize makespan (Q1743654) (← links)
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan (Q1761237) (← links)
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays (Q1767682) (← links)
- An improved L-shaped method for solving process flexibility design problems (Q1793161) (← links)
- Two-machine flowshop scheduling with a secondary criterion (Q1870802) (← links)
- Operational and financial effectiveness of e-collaboration tools in supply chain integration (Q1876185) (← links)
- Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs (Q1960313) (← links)
- Minimizing tardy jobs in a flowshop with common due date (Q1969838) (← links)
- The ordinal consistency of an incomplete reciprocal preference relation (Q2351431) (← links)
- Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence (Q2400438) (← links)
- Single machine scheduling with family setups to minimize total earliness and tardiness (Q2467252) (← links)
- Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags (Q2564876) (← links)
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs (Q2566704) (← links)
- Flowshop scheduling research after five decades (Q2572844) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
- (Q2712366) (← links)
- Two-machine no-wait flow shop scheduling with missing operations (Q2757617) (← links)
