Year |
Citation |
Score |
2019 |
Xu Y, Kim S, Bisi A, Chand S, Dada M. Structural properties of the lost sales problem with fractional lead times Operations Research Letters. 47: 410-416. DOI: 10.1016/J.Orl.2019.07.008 |
0.306 |
|
2018 |
Chand S, Prime ST, Sethi S. Production planning with multiple production lines: Forward algorithm and insights on process design for volume flexibility Naval Research Logistics. 65: 535-549. DOI: 10.1002/Nav.21817 |
0.386 |
|
2016 |
Teyarachakul S, Chand S, Tzur M. Lot sizing with learning and forgetting in setups: Analytical results and insights Naval Research Logistics. 63: 93-108. DOI: 10.1002/Nav.21681 |
0.451 |
|
2011 |
Teyarachakul S, Chand S, Ward J. Effect of Learning and Forgetting on Batch Sizes Production and Operations Management. 20: 116-128. DOI: 10.1111/J.1937-5956.2010.01140.X |
0.606 |
|
2009 |
Li J, Chand S, Dada M, Mehta S. Managing Inventory Over a Short Season: Models with Two Procurement Opportunities Manufacturing & Service Operations Management. 11: 174-184. DOI: 10.1287/Msom.1070.0204 |
0.339 |
|
2008 |
Teyarachakul S, Chand S, Ward J. Batch sizing under learning and forgetting: Steady state characteristics for the constant demand case Operations Research Letters. 36: 589-593. DOI: 10.1016/J.Orl.2008.01.007 |
0.407 |
|
2008 |
Yang WH, Chand S. Learning and forgetting effects on a group scheduling problem European Journal of Operational Research. 187: 1033-1044. DOI: 10.1016/J.Ejor.2006.03.065 |
0.434 |
|
2007 |
Chand S, Hsu VN, Sethi S, Deshpande V. A Dynamic Lot Size Problem with Multiple Customers: Customer-Specific Shipping and Backlogging Costs Iie Transactions. 39: 1059-1069. DOI: 10.1080/07408170601089497 |
0.392 |
|
2007 |
Teyarachakul S, Chand S, Tang J. Estimating the limits for statistical process control charts: A direct method improving upon the bootstrap European Journal of Operational Research. 178: 472-481. DOI: 10.1016/J.Ejor.2006.01.038 |
0.596 |
|
2003 |
Aksen D, Altınkemer K, Chand S. The single-item lot-sizing problem with immediate lost sales European Journal of Operational Research. 147: 558-566. DOI: 10.1016/S0377-2217(02)00331-4 |
0.404 |
|
2002 |
Rekhi I, Chand S, Moskowitz H. A Note on optimal allocation of work in stochastic assembly systems European Journal of Operational Research. 137: 387-393. DOI: 10.1016/S0377-2217(01)00142-4 |
0.317 |
|
2002 |
McClurg T, Chand S. A parallel machine replacement model Naval Research Logistics. 49: 275-287. DOI: 10.1002/Nav.10012 |
0.391 |
|
2001 |
Chand S, Hsu VN, Sethi S. Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography Manufacturing & Service Operations Management. 4: 25-43. DOI: 10.1287/Msom.4.1.25.287 |
0.378 |
|
2000 |
Chand S, McClurg T, Ward J. A model for parallel machine replacement with capacity expansion European Journal of Operational Research. 121: 519-531. DOI: 10.1016/S0377-2217(99)00052-1 |
0.349 |
|
1999 |
Blocher JD, Chand S, Sengupta K. The Changeover Scheduling Problem with Time and Cost Considerations: Analytical Results and a Forward Algorithm Operations Research. 47: 559-569. DOI: 10.1287/Opre.47.4.559 |
0.423 |
|
1997 |
Chand S, Traub R, Uzsoy R. Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates Annals of Operations Research. 70: 115-125. DOI: 10.1023/A:1018961818782 |
0.34 |
|
1996 |
Chand S, Moskowitz H, Novak A, Rekhi I, Sorger G. Capacity Allocation for Dynamic Process Improvement with Quality and Demand Considerations Operations Research. 44: 964-975. DOI: 10.1287/Opre.44.6.964 |
0.386 |
|
1996 |
Blocher JD, Chand S. An Improved Lower Bound for the Changeover Scheduling Problem Iie Transactions. 28: 901-909. DOI: 10.1080/15458830.1996.11770743 |
0.421 |
|
1996 |
Blocher JD, Chand S. A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem European Journal of Operational Research. 91: 456-470. DOI: 10.1016/0377-2217(95)00074-7 |
0.407 |
|
1996 |
Chand S, Traub R, Uzsoy R. An iterative heuristic for the single machine dynamic total completion time scheduling problem Computers and Operations Research. 23: 641-651. DOI: 10.1016/0305-0548(95)00071-2 |
0.393 |
|
1996 |
Chand S, Traub R, Uzsoy R. Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm Naval Research Logistics. 43: 709-719. DOI: 10.1002/(Sici)1520-6750(199608)43:5<709::Aid-Nav7>3.0.Co;2-9 |
0.399 |
|
1994 |
CHAND S, CHHAJED D, TRAUB R. A SINGLE‐MACHINE SCHEDULING MODEL WITH FIXED‐INTERVAL DELIVERIES Production and Operations Management. 3: 296-307. DOI: 10.1111/J.1937-5956.1994.Tb00126.X |
0.366 |
|
1994 |
Chand S, Ward JE, Weng ZK. A parts selection model with one-way substitution European Journal of Operational Research. 73: 65-69. DOI: 10.1016/0377-2217(94)90143-0 |
0.381 |
|
1993 |
Chand S, McClurg T, Ward J. A single‐machine replacement model with learning Naval Research Logistics. 40: 175-192. DOI: 10.1002/1520-6750(199303)40:2<175::Aid-Nav3220400204>3.0.Co;2-Q |
0.448 |
|
1992 |
Chand S, Chhajed D. A single machine model for determination of optimal due dates and sequence Operations Research. 40: 596-602. DOI: 10.1287/Opre.40.3.596 |
0.364 |
|
1992 |
Chand S, Sethi SP, Sorger G. Forecast Horizons in the Discounted Dynamic Lot Size Model Management Science. 38: 1034-1048. DOI: 10.1287/Mnsc.38.7.1034 |
0.385 |
|
1992 |
Vörös J, Chand S. Improved lot sizing heuristics for multi-stage inventory models with backlogging International Journal of Production Economics. 28: 283-288. DOI: 10.1016/0925-5273(92)90016-Z |
0.317 |
|
1992 |
Chand S, Vörös J. Setup cost stability region for the dynamic lot sizing problem with backlogging European Journal of Operational Research. 58: 68-77. DOI: 10.1016/0377-2217(92)90236-3 |
0.358 |
|
1991 |
Blocher JD, Chand S. Scheduling of parallel processors: A posterior bound on LPT sequencing and a two-step algorithm Naval Research Logistics. 38: 273-287. DOI: 10.1002/1520-6750(199104)38:2<273::Aid-Nav3220380211>3.0.Co;2-A |
0.335 |
|
1990 |
Chand S, Sethi SP, Proth J. Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Models Operations Research. 38: 884-892. DOI: 10.1287/Opre.38.5.884 |
0.401 |
|
1990 |
Chand S, Sethi SP. A dynamic lot sizing model with learning setups Operations Research. 38: 644-655. DOI: 10.1287/Opre.38.4.644 |
0.441 |
|
1989 |
Chand S. Lot sizes and setup frequency with learning in setups and process quality European Journal of Operational Research. 42: 190-202. DOI: 10.1016/0377-2217(89)90321-4 |
0.44 |
|
1988 |
Chand S, Schneeberger H. Single machine scheduling to minimize weighted earliness subject to no tardy jobs European Journal of Operational Research. 34: 221-230. DOI: 10.1016/0377-2217(88)90356-6 |
0.366 |
|
1988 |
Chand S. Decision/forecast horizon for a single facility dynamic location/relocation problem Operations Research Letters. 7: 247-251. DOI: 10.1016/0167-6377(88)90040-5 |
0.355 |
|
1987 |
Chand S, Ward J. A Note on “Economic Order Quantity under Conditions of Permissible Delay in Payments” Journal of the Operational Research Society. 38: 83-84. DOI: 10.1057/Jors.1987.10 |
0.314 |
|
1986 |
Chand S, Schneeberger H. A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness Naval Research Logistics Quarterly. 33: 551-557. DOI: 10.1002/Nav.3800330319 |
0.364 |
|
1986 |
Chand S, Morton TE. Minimal forecast horizon procedures for dynamic lot size models Naval Research Logistics Quarterly. 33: 111-122. DOI: 10.1002/Nav.3800330110 |
0.36 |
|
1985 |
Chand S, Tang K. A comparison of average and discounted cost models for the dynamic lot size inventory problem European Journal of Operational Research. 22: 9-18. DOI: 10.1016/0377-2217(85)90110-9 |
0.329 |
|
1983 |
Chand S. Rolling Horizon Procedures for the Facilities in Series Inventory Model with Nested Schedules Management Science. 29: 237-249. DOI: 10.1287/Mnsc.29.2.237 |
0.411 |
|
1983 |
Chand S, Sethi S. Finite-Production-Rate Inventory Models with First and Second Shift Setups Naval Research Logistics Quarterly. 30: 401-414. DOI: 10.1002/Nav.3800300305 |
0.345 |
|
1982 |
Chand S, Morton TE. A Perfect Planning Horizon Procedure for a Deterministic Cash Balance Problem Management Science. 28: 652-669. DOI: 10.1287/Mnsc.28.6.652 |
0.38 |
|
1982 |
Chand S. Lot sizing for products with finite demand horizon and periodic review inventory policy European Journal of Operational Research. 11: 145-148. DOI: 10.1016/0377-2217(82)90108-4 |
0.393 |
|
1982 |
Chand S, Sethi S. Planning Horizon Procedures for Machine Replacement Models with Several Possible Replacement Alternatives Naval Research Logistics Quarterly. 29: 483-493. DOI: 10.1002/Nav.3800290310 |
0.376 |
|
1981 |
Sethi S, Chand S. Multiple Finite Production Rate Dynamic Lot Size Inventory Models Operations Research. 29: 931-944. DOI: 10.1287/Opre.29.5.931 |
0.34 |
|
1980 |
Sethi SP, Chand S. Erratum to "Planning Horizon Procedures for Machine Replacement Models" Management Science. 26: 342-342. DOI: 10.1287/Mnsc.26.3.342 |
0.306 |
|
1979 |
Sethi S, Chand S. Planning Horizon Procedures for Machine Replacement Models Management Science. 25: 140-151. DOI: 10.1287/Mnsc.25.2.140 |
0.387 |
|
Show low-probability matches. |