sanjay Mehta

Followers

Following

Public Views

Daniel Estrada

Lewis-Clark State College

Janne Flora

Aarhus University

Luis Pacheco-Cobos

Universidad Veracruzana

rakesh deore

NMIMS University

Colt Knight

University of Maine

Armando Marques-Guedes

UNL - New University of Lisbon

Gwen Robbins Schug

University of North Carolina at Greensboro

Gabriel Gutierrez-Alonso

University of Salamanca

John Sutton

Macquarie University

Kevin Arbuckle

Swansea University

Interests

Uploads

Papers by sanjay Mehta

Benchmarks for shop scheduling problems

European Journal of Operational Research, 1998

... problems Ebru Demirkol, Sanjay Mehta, Reha Uzsoy School of Industrial Engineering, Purdue Uni... more

A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems

Journal of Heuristics, 1997

We examine the performance of Shifting Bottleneck (SB) heuristics for shop scheduling problems wh... more We examine the performance of Shifting Bottleneck (SB) heuristics for shop scheduling problems where the performance measure to be minimized is makespan (C max ) or maximum lateness (L max ). Extensive computational experiments are conducted on benchmark problems from the literature as well as several thousand randomly generated test problems with three different routing structures and up to 1000 operations. Several different versions of SB are examined to determine the effect on solution quality and time of different subproblem solution procedures, reoptimization procedures and bottleneck selection criteria. Results show that the performance of SB is significantly affected by job routings, and that SB with optimal subproblem solutions and full reoptimization at each iteration consistently outperforms dispatching rules, but requires high computation times for large problems. High quality subproblem solutions and reoptimization procedures are essential to obtaining good solutions. We also show that schedules developed by SB to minimize L max perform well with respect to several other performance measures, rendering them more attractive for practical use.

Download

A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems

Journal of Heuristics, 1997

We examine the performance of Shifting Bottleneck (SB) heuristics for shop scheduling problems wh... more We examine the performance of Shifting Bottleneck (SB) heuristics for shop scheduling problems where the performance measure to be minimized is makespan (C max) or maximum lateness (L max). Extensive computational experiments are conducted on benchmark problems from the literature as well as several thousand randomly generated test problems with three different routing structures and up to 1000 operations. Several different versions of SB are examined to determine the effect on solution quality and time of different subproblem solution procedures, reoptimization procedures and bottleneck selection criteria. Results show that the performance of SB is significantly affected by job routings, and that SB with optimal subproblem solutions and full reoptimization at each iteration consistently outperforms dispatching rules, but requires high computation times for large problems. High quality subproblem solutions and reoptimization procedures are essential to obtaining good solutions. We also show that schedules developed by SB to minimize L max perform well with respect to several other performance measures, rendering them more attractive for practical use.

Download

Benchmarks for shop scheduling problems

European Journal of Operational Research, 1998

... problems Ebru Demirkol, Sanjay Mehta, Reha Uzsoy School of Industrial Engineering, Purdue Uni... more

A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems

Journal of Heuristics, 1997

Download

A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems

Journal of Heuristics, 1997

We examine the performance of Shifting Bottleneck (SB) heuristics for shop scheduling problems wh... more We examine the performance of Shifting Bottleneck (SB) heuristics for shop scheduling problems where the performance measure to be minimized is makespan (C max) or maximum lateness (L max). Extensive computational experiments are conducted on benchmark problems from the literature as well as several thousand randomly generated test problems with three different routing structures and up to 1000 operations. Several different versions of SB are examined to determine the effect on solution quality and time of different subproblem solution procedures, reoptimization procedures and bottleneck selection criteria. Results show that the performance of SB is significantly affected by job routings, and that SB with optimal subproblem solutions and full reoptimization at each iteration consistently outperforms dispatching rules, but requires high computation times for large problems. High quality subproblem solutions and reoptimization procedures are essential to obtaining good solutions. We also show that schedules developed by SB to minimize L max perform well with respect to several other performance measures, rendering them more attractive for practical use.

Download

sanjay Mehta

Related Authors

Uploads

Papers by sanjay Mehta

Log In