Parallel machine selection and job scheduling to minimize sum of machine holding cost, total machine time costs, and total tardiness costs

IEEE Transactions on Automation Science and Engineering

Volumn 11, Issue 1, 2014, Pages 294-301

  Alidaee, Bahram ^a   Li, Haitao ^b  

^a UNIVERSITY OF MISSISSIPPI   (United States)

^b UNIVERSITY OF MISSOURI ST LOUIS   (United States)

Author keywords

Complexity; logistics; outsourcing; scheduling

Indexed keywords

COMBINATORIAL OPTIMIZATION; COSTS; DYNAMIC PROGRAMMING; JOB SHOP SCHEDULING; LOGISTICS; OUTSOURCING; SCHEDULING;

COMPLEXITY; DYNAMIC PROGRAMMING ALGORITHM; LOWER AND UPPER BOUNDS; MULTIPLE CHOICE KNAPSACK PROBLEM; PARALLEL MACHINE; PROCESSING TIME; SINGLE SINK FIXED CHARGE TRANSPORTATION PROBLEM; TOTAL TARDINESS;

PROBLEM SOLVING;

EID: 84892598489     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2013.2247757     Document Type: Article

References (72)

1. A. Abdekhodaee, A.Wirth, and H. S. Gan, "Equal processing and equal setup time cases of scheduling parallel machines with a single server," Comput. Oper. Res., vol. 31, pp. 1867-1889, 2004.
2. B. Alidaee, G. Kochenberger, and M. M. Amini, "Greedy solution of selection and ordering problems," Eur. J. Oper. Res., vol. 134, pp. 203-215, 2001.
3. B. Alidaee and G. Kochenberger, "A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem," Trans. Sci., vol. 39, no. 1, pp. 140-143, 2005.
4. N. Alon, Y. Azar, G. Woeginger, and T. Yadid, "Approximation schemes for scheduling on parallel machines," J. Scheduling, vol. 1, pp. 55-66, 1998.
5. Y. Azar, A. Epstein, and L. Epstein, "Load balancing of temporary tasks in the norm," Theor. Comput. Sci., vol. 361, pp. 314-328, 2006.
6. P. Brucker and S. A. Kravchenko, "Scheduling jobs with equal processing times and time windows on identical parallel machines," J. Scheduling, vol. 11, pp. 229-237, 2008.
7. P. Brucker and S. Knust, Complexity Results for Scheduling Problems, 2012. [Online]. Available: http://www.informatik.uni-osnabrueck.de/knust/class/
8. D. Cao, M. Chen, and G. Wan, "Parallel machine selection and job scheduling to minimize machine cost and job tardiness," Comput. Oper. Res., vol. 32, pp. 1995-2012, 2005.
9. K. Chakhlevitch, C. A. Glass, and H. Kellerer, "Batch machine production with perishability time windows and limited batch size," Eur. J. Oper. Res., vol. 210, pp. 39-47, 2011.
10. F. T. S. Chan, V. Kumar, and M. K. Tiwari, "The relevance of outsourcing and leagile strategies in performance optimization of an integrated process planning and scheduling model," Int. J. Prod. Res., vol. 47, no. 1, pp. 119-142, 2009.
11. A. Chandra and C. Wong, "Worst-case analysis of a placement algorithm related to storage allocation," SIAM J. Comput., vol. 4, no. 3, pp. 249-263, 1975.
12. F. Chen, M. P. Johnson, Y. Alayev, A. Bar-Noy, and T. F. L. Porta, "Who, when, where: Timeslot assignment to mobile clients," IEEE Trans. Mobile Comput., vol. 11, no. 1, pp. 73-85, Jan 2012.
13. Z.-L. Chen and C.-L. Li, "Scheduling with subcontracting options," IIE Trans., vol. 40, pp. 1171-1184, 2008.
14. F. Chu and C. Chu, "Single-item dynamic lot-sizing models with bounded inventory and outsourcing," IEEE Trans. Syst., Man, Cybern. - Part A, vol. 38, no. 1, pp. 70-77, Jan. 2008.
15. S. Chopra and P. Meindl, Supply Chain Management: Strategy, Planning, and Operations, 4th ed. Englewood Cliffs, NJ, USA: Prentice-Hall, 2010.
16. D. Chung, K. Lee, K. Shin, and J. Park, "A new approach to jobshop scheduling problems with due date constraints considering operation subcontracts," Int. J. Prod. Economics, vol. 98, pp. 238-250, 2005.
17. J. Clifford and M. Posner, "High multiplicity in earliness-tardiness scheduling," Oper. Res., vol. 48, no. 5, pp. 788-800, 2000.
18. R. A. Cody and E. G. Coffman, "Record allocation for minimizing expected retrieval costs on drum-like storage devices," J. Assoc. Comput. Mach., vol. 23, pp. 103-115, 1976.
19. A. Cossari, J. C. Ho, G. Paletta, and A. J. Ruiz-Torres, "A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria," Comput. Oper. Res., vol. 39, pp. 1382-1393, 2012.
20. A. Dhawan, S. Srinivasan, P. Rajib, and B. Bidanda, "Minimising total cost with regular and emergency outsourcing sources: A neuro-dynamic programming approach," Int. J. Prod. Res., vol. 47, no. 20, pp. 5811-5827, 2009.
21. F. G. Engineer, P. Keskinocak, and L. K. Pickering, "Catch-up scheduling for childhood vaccination," Oper. Res., vol. 57, no. 6, pp. 1307-1319, 2009.
22. A. Epstein and J. Sgall, "Approximation schemes for scheduling on uniformly related and identical parallel machines," Algorithmica, vol. 39, pp. 43-57, 2004.
23. L. Fanjul-Peyro and R. Ruiz, "Scheduling unrelated parallel machines with optional machines and jobs selection," in Comput. Oper. Res., 2012, vol. 39, pp. 1745-1753.
24. G. Fayolle, E. Gelenbe, J. Labetoulle, and D. Bastin, "The stability problem of broadcast packet switching computer networks," Acta Informatica, vol. 4, pp. 49-53, 1974.
25. G. Finke, P. Lemaire, J.-M. Proth, and M. Queyranne, "Minimizing the number of machines for minimum length schedules," Eur. J. Oper. Res., vol. 199, pp. 702-705, 2009.
26. R. S. Gaonkar and N. Viswanadham, "Strategic sourcing and collaborative planning in Internet-enabled supply chain networks producing multigeneration products," IEEE Trans. Autom Sci. Eng., vol. 2, no. 1, pp. 54-66, Jan. 2005.
27. C. A. Glass and H. R. Mills, "Scheduling unit length jobs with parallel nested machine processing set restrictions," Comput. Oper. Res., vol. 33, pp. 620-638, 2006.
28. R. R. Goldberg and J. Shapiro, "Partitioning under the norm," Eur. J. Oper. Res., vol. 123, pp. 585-592, 2000.
29. J. C. Ho, T.-L. Tseng, A. J. Ruiz-Torres, and F.-J. Lopez, "Minimizing the normalized sum of square for workload deviations on m parallel processors," Comput. Ind. Eng., vol. 56, pp. 186-192, 2009.
30. T. Ibaraki and N. Katoh, Resource Allocation Problems: Algorithmic Approaches. Cambridge, MA, USA: MIT Press, 1988.
31. S. Kameshwaran and Y. Narahari, "Nonconvex piecewise linear knapsack problems," Eur. J. Oper. Res., vol. 192, pp. 56-68, 2009.
32. K. Kogan, S. Lou, C. S. Tapiero, and M. Shnaiderman, "Supply chain with inventory review and dependent demand distributions: Dynamic inventory outsourcing," IEEE Trans. Autom Sci. Eng., vol. 7, no. 2, pp. 197-207, Apr. 2010.
33. S. Kravchenko and F. Werner, "Minimizing the number of machines for scheduling jobs with equal processing times," Eur. J. Oper. Res., vol. 199, pp. 595-600, 2009.
34. S. Kravchenko and F. Werner, "Parallel machine problems with equal processing times: A survey," J. Scheduling, vol. 14, pp. 435-444, 2011.
35. S. Kreipl and M. Pinedo, "Planning and scheduling in supply chains: An overview of issues in practice," Prod. Oper. Manage., vol. 13, pp. 77-92, 2004.
36. W. Kubiak, D. Rebaine, and C. Potts, "Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors," Discrete Opt., vol. 6, pp. 79-91, 2009.
37. V. Lauff and F.Werner, "Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey," Math. Comput. Modeling, vol. 40, pp. 637-655, 2004.
38. K. Lee and B.-C. Chio, "Two-stage production scheduling with an outsourcing option," Eur. J. Oper. Res., vol. 213, pp. 489-497, 2011.
39. S. I. Lee and C. S. Sung, "Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed," Eur. J. Oper. Res., vol. 186, pp. 931-952, 2008a.
40. S. I. Lee and C. S. Sung, "Single machine scheduling with outsourcing allowed," Int. J. Prod. Economics, vol. 111, pp. 623-634, 2008b.
41. S. Lee, J. Turner, M. S. Daskin, T. Homem-de-Mello, and K. Smilowitz, "Improving fleet utilization for carriers by interval scheduling," Eur. J. Oper. Res., vol. 218, pp. 261-269, 2012.
42. F. T. Leighton, B. M. Maggs, and S. B. Rao, "Packet routing and jobshop scheduling in O(congestion+dilation) steps," Combinatorica, vol. 14, no. 2, pp. 167-186, 1994.
43. F. T. Leighton, B. M. Maggs, and A. W. Richa, "Fast algorithm for finding O(congestion+dilation) packet routing schedules," Combinatorica, vol. 19, no. 3, pp. 375-401, 1999.
44. J. Leung and C.-L. Li, "Scheduling with processing set restrictions: A survey," Int. J. Prod. Economics, vol. 116, pp. 251-262, 2008.
45. L. L. Liu, C. T. Ng, and T. C. E. Cheng, "Bicriterion scheduling with equal processing times on a batch processing machine," Comput. Oper. Res., vol. 36, pp. 110-118, 2009.
46. N. Mishra, A. K. Choudhary, and M. K. Tiwari, "Modeling the planning and scheduling across the outsourcing supply chain: A chaosbased fast Tabu-SA approach," Int. J. Prod. Res., vol. 46, no. 13, pp. 3683-3715, 2008.
47. H. Mokhtari, I. N. K. Abadi, and M. R. Amin-Naseri, "Production scheduling with outsourcing scenarios: A mixed integer programming and efficient solution procedure," Int. J. Prod. Res., vol. 50, no. 19, pp. 1-24, 2012.
48. G. Mosheiv and M. Shadmon, "Minmax earliness-tardiness costs with unit processing time jobs," Eur. J. Oper. Res., vol. 130, pp. 638-652, 2001.
49. G. Mosheiv, "Scheduling unit processing time jobs on an m-machine flow-shop," J. Oper. Res. Soc., vol. 54, pp. 437-441, 2003.
50. G. Mosheiv and D. Oron, "Due-window assignment with unit processing-time jobs," Nav. Res. Logist., vol. 51, pp. 1005-1017, 2004.
51. G. Mosheiv and A. Sarig, "A note: A due-window assignment problem on parallel identical machines," J. Oper. Res. Soc., vol. 62, pp. 238-241, 2011.
52. D. Naso, M. Surico, and B. Turchiano, "Reactive scheduling of a distributed network for the supply of perishable products," IEEE Trans. Autom Sci. Eng., vol. 4, no. 3, pp. 407-423, Jul. 2007.
53. M. Pinedo, Scheduling: Theory, Algorithms and Systems, 3rd ed. Englewood Cliffs, NJ, USA: Prentice-Hall, 2008.
54. X. Qi, "Coordinated logistics scheduling for in-house production and outsourcing," IEEE Trans. Autom Sci. Eng., vol. 5, no. 1, pp. 188-192, Jan. 2008.
55. X. Qi, "Outsourcing and production scheduling for a two-stage flow shop," Int. J. Prod. Economics, vol. 129, pp. 43-50, 2011.
56. R. de Freitas Rodrigues, M. C. Douradob, and J. L. Szwarcfiter, "Scheduling problem with multi-purpose parallel machines," Discrete Appl. Math., 2011, doi:10.1016/j.dam.2011.11.033.
57. A. J. Ruiz-Torres, J. C. Ho, and F. J. Lopez, "Generating Pareto schedules with outsource and internal parallel resources," Int. J. Prod. Economics, vol. 103, pp. 810-825, 2006.
58. A. J. Ruiz-Torres, F. J. Lopez, J. C. Ho, and P. J.Wojciechowski, "Minimizing the average tardiness: The case of outsource machines," Int. J. Prod. Res., vol. 46, no. 13, pp. 3615-3640, 2008.
59. A. J. Ruiz-Torres, F. J. Lopez, P. J. Wojciechowski, and J. C. Ho, "Parallel machine scheduling problems considering regular measures of performance and machine cost," J. Oper. Res. Soc., vol. 61, pp. 849-857, 2010.
60. E. Selvarajah and G. Steiner, "Approximation algorithms for the supplier's supply chain scheduling problem to minimize delivery and inventory holding costs," Oper. Res., vol. 48, no. 2, pp. 343-378, 2009.
61. S. V. Sevastianov, "An introduction to multi-parameter complexity analysis of discrete problems," Eur. J. Oper. Res., vol. 165, pp. 387-397, 2005.
62. W. Shen, L. Wang, and Q. Hao, "Agent-based distributed manufacturing process planning and scheduling: A state-of-the-art survey," IEEE Trans. Syst., Man, Cybern. - Part C, vol. 36, no. 4, pp. 563-577, 2006.
63. V. G. Timkovsky, "Is a unit-time job shop not easier than identical parallel machines?," Discrete Appl. Math., vol. 85, pp. 149-168, 1998.
64. V. J. Timkovsky, "Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity," Eur. J. Oper. Res., vol. 149, pp. 355-376, 2003.
65. G. L. Vairaktarakis and X. Cai, "The value of processing flexibility in multipurpose machines," IIE Trans., vol. 35, no. 8, pp. 763-774, 2003.
66. N. Viswanadham and R. S. Gaonkar, "Partner selection and synchronized planning in dynamic manufacturing networks," IEEE Trans. Robot. Autom., vol. 19, no. 1, pp. 117-130, 2003.
67. G. Yu and G. Zhang, "Scheduling with a minimum number of machines," Oper. Res. Lett., vol. 37, pp. 97-101, 2009.
68. S. H. Zegordi and M. A. B. Nia, "A multi-population genetic algorithm for transportation scheduling," Transp. Res. Part E, vol. 45, pp. 946-959, 2009.
69. D. D. Zeng and J. L. Zhao, "Effective role resolution in workflow management," INFORMS J. Comput., vol. 17, no. 3, pp. 374-387, 2005.
70. X. Zhang and J. F. Bard, "A multi-period machine assignment problem," Eur. J. Oper. Res., vol. 170, pp. 398-415, 2006.
71. L. Zhen, "A decision model on production planning with outsourcing," IEEE Trans. Syst., Man, Cybern. - Part A, vol. 42, no. 2, pp. 497-502, 2012.
72. W. Zhong and Z. Huo, "Single machine scheduling problems with subcontracting options," J. Combinatorial Opt., 2011.