A Benders decomposition approach to the weighted number of tardy jobs scheduling problem on unrelated parallel machines with production costs

References

• Al-Khamis, T., and R. M’Hallah. 2011. “A Two-stage Stochastic Programming Model for the Parallel Machine Scheduling Problem with Machine Capacity.” Computers and Operations Research 38: 1747–1759.
   Web of Science ®Google Scholar
• Alidaee, B., and H. Li. 2014. “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 11 (1): 294–301.
   Web of Science ®Google Scholar
• Angel, E., E. Bampis, and A. Kononov. 2001. “A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.” Lecture Notes in Computer Science 2161: 194–205.
   Google Scholar
• Boysen, N., D. Briskorn, and M. Tschoke. 2013. “Truck Scheduling in Cross-docking Terminals with Fixed Outbound Departures.” OR Spectrum 35: 479–504.
   Web of Science ®Google Scholar
• Brucker, P., and S. Kravchenko. 2006. “Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs.” Journal of Mathematical Modelling and Algorithms 2: 245–252.
   Google Scholar
• Cakici, E., and S. J. Mason. 2007. “Parallel Machine Scheduling Subject to Auxiliary Resource Constraints.” Production Planning and Control 18: 217–225.
   Web of Science ®Google Scholar
• Cevikcan, E., and M. B. Durmusoglu. 2014. “An Integrated Job Release and Scheduling Approach on Parallel Machines: An Application in Electric Wire-harness Industry.” Computers and Industrial Engineering 76: 318–332.
   Web of Science ®Google Scholar
• Chen, L., K. Jansen, W. Luo, and G. Zhang. 2015. “Approximation Algorithms for Scheduling Parallel Machines with Capacity Constraints.” Accessed January, 2015. http:www.cs.zju.edu.cn/algo/file/Scheduling_Cardinality.pdf
   Google Scholar
• Chen, Z., and W. B. Powell. 1999. “Solving Parallel Machine Scheduling Problems by Column Generation.” INFORMS Journal on Computing 11: 78–94.
   Web of Science ®Google Scholar
• Dourado, M., R. Rodrigues, and J. Szwarcfiter. 2009. “Scheduling Unit Time Jobs with Integer Release Dates to Minimize the Weighted Number of Tardy Jobs.” Annals of Operations Research 169: 81–91.
   Web of Science ®Google Scholar
• Fanjul-Peyro, L., and R. Ruiz. 2012. “Scheduling Unrelated Parallel Machines with Optional Machines and Jobs Selection.” Computers and Operations Research 39 (7): 1745–1753.
   Web of Science ®Google Scholar
• Gafarov, E. R., A. A. Lazarev, and F. Werner. 2011. “Single Machine Scheduling Problems with Financial Resource Constraints: Some Complexity Results and Properties.” Mathematical Social Sciences 62: 7–13.
   Web of Science ®Google Scholar
• Li, K., and S. Yang. 2009. “Non-identical Parallel-machine Scheduling Research with Minimizing Total Weighted Completion Times: Models, Relaxations and Algorithms.” Applied Mathematical Modeling 33: 2145–2158.
   Web of Science ®Google Scholar
• Liu, S. Q., and E. Kozan. 2009. “Scheduling Trains as a Blocking Parallel-machine Job Shop Scheduling Problem.” Computers and Operations Research 36: 2840–2852.
   Web of Science ®Google Scholar
• Lin, Y. K. 2013. “Fast LP Models and Algorithms for Identical Jobs on Uniform Parallel Machines.” Applied Mathematical Modelling 37: 3436–3448.
   Web of Science ®Google Scholar
• M’Hallah, R., and R. L. Bulfin. 2005. “Minimizing the Weighted Number of Tardy Jobs on Parallel Processors.” European Journal of Operational Research 160: 471–484.
   Web of Science ®Google Scholar
• Mellouli, R., C. Sadfi, C. Chu, and I. Kacem. 2009. “Identical Parallel-machine Scheduling Under Availability Constraints to Minimize the Sum of Completion Times.” European Journal of Operational Research 197: 1150–1165.
   Web of Science ®Google Scholar
• Rasti-Barzoki, M., S. R. Hejazi, and M. M. Mazdeh. 2013. “A Branch and Bound Algorithm to Minimize the Total Weighed Number of Tardy Jobs and Delivery Costs.” Applied Mathematical Modelling 37: 4924–4937.
   Web of Science ®Google Scholar
• Rodrigues, R. F., M. C. Dourado, and J. L. Szwarcfiter. 2014. “Scheduling Problem with Multi-purpose Parallel Machines.” Discrete Applied Mathematics 164: 313-319.
   Web of Science ®Google Scholar
• Ruiz-Torres, A. J., J. H. Ablanedo-Rosas, N. R. A. Bansui, F. Mahmoodi, and A. Z. Zeng. 2014. “Production Planning of Parallel Resources Considering Yields, Failures and Production Costs.” International Journal of Applied Management Science 6 (2): 99–117.
   Google Scholar
• Ruiz-Torres, A. J., F. J. Lopez, and J. C. Ho. 2007. “Scheduling Uniform Parallel Machines Subject to a Secondary Resource to Minimize the Number of Tardy Jobs.” European Journal of Operational Research 179: 302–315.
   Web of Science ®Google Scholar
• Ruiz-Torres, A. J., F. J. Lopez, P. J. Wojciechowski, and J. C. Ho. 2010. “Parallel Machine Scheduling Problems Considering Regular Measures of Performance and Machine Cost.” Journal of the Operational Research Society 61 (5): 849–857.
   Web of Science ®Google Scholar
• Shmoys, D. B., and E. Tardos. 1993. “An Approximation Algorithm for the Generalized Assignment Problem.” Mathematical Programming 62: 461–474.
   Web of Science ®Google Scholar
• Unlu, Y., and S. J. Mason. 2010. “Evaluation of Mixed Integer Programming Formulations for Non-preemptive Parallel Machine Scheduling Problems.” Computers and Industrial Engineering 58: 785–800.
   Web of Science ®Google Scholar
• Woeginger, G. H. 2005. “A Comment on Scheduling Two Parallel Machines with Capacity Constraints.” Discrete Optimization 2: 269–272.
   Google Scholar
• Yang, H., Y. Ye, and J. Zhang. 2003. “An Approximation Algorithm for Scheduling Two Parallel Machines with Capacity Constraints.” Discrete Applied Mathematics 130: 449–467.
   Web of Science ®Google Scholar
• Zhang, C., G. Wang, X. Liu, and J. Liu. 2009. “Approximating Scheduling Machines with Capacity Constraints.” Lecture Notes in Computer Science 5598: 283–292.
   Google Scholar