Prof. Dvir Shabtay Profile

Prof. Dvir Shabtay

Professor

Department :	Department of Industrial Engineering and Management
Room :	263 בנין המחלקה להנדסת תעשייה וניהול - 16
Phone :	972-8-6461389
Email :	dvirs@bgu.ac.il
Office Hours :

Education

B.Sc. : 1993-1997, Dept. of Industrial Engineering and Management
Ben-Gurion University of the Negev, Beer Sheva, Israel
M.Sc. : 1997-1999, Dept. of Industrial Engineering and Management
Ben-Gurion University of the Negev, Beer Sheva, Israel
Advisor : Dr. M. Kaspi.
Title : "Optimization of the machining economics problem."
Ph.D . : 1999-2003, Dept. of Industrial Engineering and Management
Ben-Gurion University of the Negev, Beer Sheva, Israel
Advisor : Dr. M. Kaspi.
Title : "Convex resource allocation within various scheduling problems."

Research Interests

Scheduling, combinatorial optimization, approximation algorithms and computational complexity.

Publications and funding summary / representative publications and grants

1. Shabtay, D ., and Kaspi, M., 2001, "Optimization of the Machining Economics Problem under the Periodic Control Strategy", International Journal of Production Research, Vol. 39, No. 17, pp. 3889-3900.
2. Shabtay, D ., and Kaspi, M., 2002, "Optimization of the Machining Economics Problem Under the Failure Replacement Strategy", International Journal of Production Economics, Vol. 80, No. 3, pp. 213-230.
3. Kaspi, M., and Shabtay, D., 2003, "Optimization of Machining Economics Problem for a Multi-Stage Transfer Machine Under Failure, Opportunistic and Integrated Replacement Strategies", International Journal of Production Research, Vol. 41, No. 10, pp. 2229-2248.
4. Kaspi, M., and Shabtay, D., 2003, "The Efficiency Range of Economical Cutting Conditions and Tool Replacement under the Age Replacement Strategy", International Journal of Production Research, Vol. 41, No. 11, pp. 2563-2580.
5. Shabtay, D., 2004, "A Single and a Two-Resource Allocation Problem for Minimizing the Maximal Lateness in a Single Machine-Scheduling Problem", Computers and Operations Research, Vol. 31, No. 8, pp. 1303-1315.
6. Kaspi, M., and Shabtay, D., 2004, "Convex Resource Allocation for Minimizing the Makespan in a Single Machine with Release Dates", Computers and Operations Research, Vol. 31, No. 9, pp. 1481-1489.
7. Shabtay, D., and Kaspi, M., 2004, "Minimizing the Total Weighted Flow Time in a Single Machine with Controllable Processing Times", Computers and Operations Research, Vol. 31, No.13, pp. 2279-2289.
8. Kaspi, M., and Shabtay, D., 2006, "A Bicriterion Approach to Time/Cost Trade-Offs in Scheduling with Convex Resource-Dependent Job Processing Times and Release Dates", Computers and Operations Research, Vol. 33, No. 10, pp. 3015-3033.
9. Shabtay, D., and Kaspi, M., 2006, "Minimizing the Makespan in Open Shop Scheduling Problems with Convex Resource-Dependent Processing Times", Naval Research Logistics, Vol. 53, No. 3, pp. 204-216.
10. Shabtay, D., and Kaspi, M., 2006, "Parallel Machine Scheduling with Convex Resource-Dependent Processing Times", European Journal of Operational Research, Vol. 173, No. 1, pp. 92-107.
11. Shabtay, D., and Steiner, G., 2006, "Two Due Date Assignment Problems in Scheduling a Single Machine", Operations Research Letters, Vol. 34, No. 6, pp. 683-691.
12. Shabtay, D., and Steiner, G., 2007, "Single Machine Batch-Scheduling to Minimize Total Completion Time and Resource Consumption Costs", Journal of Scheduling, Vol. 10, pp. 255-261.
13. Shabtay, D., Kaspi, M., and Steiner, G., 2007, "The No-Wait Two-Machine Flow-Shop Scheduling Problem with Convex Resource-Dependent Processing Times", IIE Transactions, Vol. 39, No. 5, pp. 539-557.
14. Shabtay, D., and Kaspi, M., 2007, “ The efficiency range of economical cutting conditions for a multistage transfer machine under a failure replacement strategy ", International Journal of Advanced Manufacturing Technology, Vol. 34, pp. 448-456.
15. Shabtay, D., and Steiner, G., 2007, "Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine", Manufacturing & Service Operations Management, Vol. 9, No. 3, pp. 332-350.
16. Shabtay, D., and Steiner, G., 2007, "A Survey of Scheduling with Controllable Processing Times", Discrete Applied Mathematics, Vol. 155, No. 13, pp. 1643-1666.
17. Shabtay, D., 2008, "Due date assignments and scheduling a single machine with a general earliness/tardiness cost function", Computers and Operations Research, Vol. 35, No. 5, pp. 1539-1545.
.
18. Shabtay, D., and Steiner, G., 2008, "The Single Machine Earliness-Tardiness Scheduling Problem with Due Date Assignment and Resource-Dependent Processing Times", Annals of Operations Research, Vol. 159, pp. 25-40.
19. Yedidsion, L., Shabtay, D., and Kaspi, M., 2007, "A Bicriterion Approach to Minimize Maximal Lateness and Resource Consumption in Scheduling with Convex Resource-Dependent Processing Time", Journal of Scheduling, Vol. 10, No. 6, pp. 341-352.
20. Shabtay, D., and Steiner, G., 2008, "Optimal Due Date Assignment in Multi-Machine Scheduling Environments", Journal of Scheduling, Vol. 11, No. 3, pp. 217-228.
21. Yedidsion L., Shabtay, D., and Kaspi, M., 2009, "Minimizing the Sum of Completion Times with Resource Dependant Times", International Journal of Operations and Quantitative Management, Vol. 15, No. 2, pp. 117-125.
22. Yedidsion, L., Shabtay, D., Korach, A., and Kaspi, M., 2009, "A Bicriteria Approach to Minimize Number of Tardy Jobs and Resource Consumption in Scheduling a Single Machine", International Journal of Production Economics, Vol. 119, pp. 298 – 307.
23. Shabtay, D., 2010, "Scheduling and Due Date Assignment to Minimize Earliness, Tardiness, Holding, Due Date Assignment and Batch Delivery Cost", International Journal of Production Economics, Vol. 123, No. 1, pp. 235 - 242.
24. Leyvand, Y., Shabtay, D., Steiner, G., and Yedidsion, L., 2010, "Just-in-Time Scheduling with Controllable Processing Times on Single and Parallel Machines", Journal of Combinatorial Optimization, Vol. 19, No. 3, pp. 347 - 368.
25. Leyvand, Y., Shabtay, D., and Steiner, G., 2010, "Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times", IIE Transactions, Vol. 42, No. 3, pp. 221 - 231.
26. Yedidsion, L., Shabtay, D., and Steiner, G., 2010, "Bicriteria Problems to Minimize Maximum Tardiness and Due Date Assignment Cost in Various Scheduling Environments", Discrete Applied Mathematics, Vol. 158, No. 10, pp. 1090-1103.
27. Leyvand, Y., Shabtay, D., and Steiner, G., 2010, " A unified approach for scheduling with convex resource consumption functions using positional penalties ", European Journal of Operational Research, Vol. 206, No. 2, pp. 301-312.
28. Shabtay, D., Yedidsion, L., Itskovich, Y., and Oron, D., 2010, "Optimal Due Dates Assignment and Resource Allocation in Group Technology Scheduling Environment", Computers and Operations Research, 37, No. 12, pp. 2218-2228.
29. De?neko, V.G., Shabtay, D., and Steiner, G., 2011, "On the Asymptotic Behavior of Subtour-Patching Heuristics in Solving the TSP on Permuted Monge Matrices", Journal of Heuristics, Vol. 17, No. 1, 61-96.
30. Mandelbaum, M., and Shabtay, D., 2011, "Scheduling Unit Length Jobs on Parallel Machines with Lookahead Information", Journal of Scheduling, Vol. 14, No. 4, 335-350.
31. Shabtay, D., Gasper, N., and Yedidsion, L., 2011, "A Bicriteria Approach to Scheduling a Single Machine with Rejection and Positional Penalties", Journal of Combinatorial Optimization, Vol. 23, No. 4, 39-47.
32. Shabtay, D., and Bensusan, Y., 2012, "Maximizing the Weighted Number of Just-in Time Jobs in Several Two-Machine Scheduling Systems", Journal of Scheduling, Vol. 15, No. 1 , pp. 39-47.
33. Shabtay, D., and Steiner, G., 2011, "Bicriteria Approach to Minimize the Total Weighted Number of Tardy Jobs with Convex Controllable Processing Times and Assignable Due Dates", Journal of Scheduling, Vol. 14, No. 5 , pp. 455-469.
34. Yedidsion, L., Shabtay, D., and Kaspi, M., 2011, "Complexity Analysis of an Assignment Problem with Controllable Assignment and its applications in scheduling", Discrete Applied Mathematics, Vol. 159, No. 12 , pp. 1264-1278.
35. Shabtay, D., and Karhi, S., 2011, "Online Scheduling of Two Job Types on a Set of Multipurpose Machines with Unit Processing Times", Computers and Operations Research, Vol. 39, No. 2 , pp. 405-412.
36. Shabtay, D., and Gasper, N., 2012, "Two-Machine Flow-Shop with Rejection", Computers and Operations Research, Vol. 39, No. 5, pp. 1087-1096.
37. Shabtay, D., 2012, "The Just-in-Time Scheduling Problem in a Flow-Shop Scheduling System", European Journal of Operational Research, Vol. 216, No. 3, pp. 521-532.
38. Shabtay, D., Bensusan, Y., and Kaspi, M., 2012, "A Bicriteria Approach to Maximize the Weighted Number of Just-In-Time Jobs and to Minimize the Total Resource Consumption Cost in a Two-Machine Flow-Shop Scheduling System", International Journal of Production Economics, Vol. 136, No. 1, pp. 37-74.
39. Shabtay, D., and Karhi, S., 2013, "On the Optimality of the TLS Algorithm for Solving the Online-List Scheduling Problem with Two Job Types on a set of Multipurpose Machines", Journal of Combinatorial Optimization, Vol. 26, No. 1, pp. 198-222.
40. Shabtay, D., and Karhi, S., 2012, " An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times ", Discrete Optimization, Vol. 9, No. 4, pp. 241-248.
41. Shabtay, D., Gasper, N., and Kaspi, M., 2013, "A Survey on Scheduling Problems with Rejection", Journal of Scheduling, Vol. 16, No. 1, pp. 3-28.
42. Mosheiov, G., and Shabtay, D., 2013, "Maximizing the Weighted Number of Just-in-Time Jobs on a Single Machine with Position-Dependent Processing Times", Journal of Scheduling, Vol. 16, No. 5, pp. 519-527.
43. Mor B., Mosheiov, G.,and Shabtay, D., 2013, "A Note: Minmax Due-Date Assignment Problem with Lead-Time Cost", Computers and Operations Research, Vol. 40, No. 8, 2161-2164.
44. Shabtay, D ., Arviv , K., Edan, Y., and Stern, H., 2014, "A Combined Robot Selection and Scheduling Problem for Flow-Shops with No-Wait Restrictions", Omega, Vol. 43, 96-107.
45. Shabtay, D., 2014, "The Single Machine Serial Batch Scheduling Problem with Rejection to Minimize Total Completion Time and Total Rejection Cost", European Journal of Operational Research, Vol. 233, No. 1, 64-74.
46. Shabtay, D., Steiner, G., and Yedidsion, L., "A Pseudo-Polynomial Time Algorithm for Solving the Resource Dependent Assignment Problem", Discrete Applied Mathematics, Accepted, August 2013.
47. Karhi, S., and Shabtay, D., "Online Scheduling of Two Job Types on a Set of Multipurpose Machines", International Journal of Production Economics, Accepted, December 2013.