Skip to main content
SpringerLink
Log in

Generating bicriteria schedules for correlated parallel machines involving tardy jobs and weighted completion time

  • Original Research
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This research focuses on studying the correlated parallel machine scheduling problem with release dates to minimize the number of tardy jobs and the total weighted completion time to find Pareto optima of all non-dominated solutions for both criteria. First, a mixed integer programming (MIP) model to find the entire efficient frontier for the studied problem has been proposed. Next, a bicriteria heuristic, named UTWC, and three artificial bee colony (ABC) variant algorithms have been proposed to tackle the studied problem. The three ABC variant algorithms are ABC, ABC with variable neighborhood search scheme (ABC_VNS), and ABC with simulated annealing scheme (ABC_SA). For small problem instances, we compare the proposed heuristic UTWC and three ABC variant algorithms with the efficient frontier generated by solving the MIP model. For large problem instances, we compare the UTWC and three ABC variant algorithms with an existing multi-objective tabu search algorithm (TSA). We create a reference set by combining the solutions from the three ABC variant algorithms and the TSA. The computational results indicate that the UTWC heuristic can find a set of non-dominated solutions that are uniformly distributed above the efficient frontier. The proposed ABC_VNS algorithm outperforms all the compared algorithms in both small and large problem instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Angel, E., Bampis, E., & Kononov, A. (2003). On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theoretical Computer Science, 306(1), 319–338.

    Article  Google Scholar 

  • Asadzadeh, L. (2016). A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy. Computers & Industrial Engineering, 102, 359–367.

    Article  Google Scholar 

  • Balasubramanian, H., Fowler, J., Keha, A., & Pfund, M. (2009). Scheduling interfering job sets on parallel machines. European Journal of Operational Research, 199(1), 55–67.

    Article  Google Scholar 

  • Caniyilmaz, E., Benli, B., & Ilkay, M. S. (2015). An artificial bee colony algorithm approach for unrelated parallel machine scheduling with processing set restrictions, job sequence-dependent setup times, and due date. The International Journal of Advanced Manufacturing Technology, 77(9–12), 2105–2115.

    Article  Google Scholar 

  • Cao, D., Chen, M., & Wan, G. (2005). Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Computers & Operations Research, 32(8), 1995–2012.

    Article  Google Scholar 

  • Cerny, V. (1985). A thermodynamic approach to the traveling salesman problem: An efficient simulation. Journal of Optimization Theory and Applications, 45, 41–51.

    Article  Google Scholar 

  • Chang, P. C., Chen, S. H., & Lin, K. L. (2005). Two-phase sub population genetic algorithm for parallel machine-scheduling problem. Expert Systems with Applications, 29, 705–712.

    Article  Google Scholar 

  • Cheng, R., Gen, M., & Tosawa, T. (1995). Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms. Computers and Industrial Engineering, 29, 513–517.

    Article  Google Scholar 

  • Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182–197.

    Article  Google Scholar 

  • Driessel, R., & Mönch, L. (2011). Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times. Computers & Industrial Engineering, 61(2), 336–345.

    Article  Google Scholar 

  • Dugardin, F., Yalaoui, F., & Amodeo, L. (2010). New multi-objective method to solve reentrant hybrid flow shop scheduling problem. European Journal of Operational Research, 203(1), 22–31.

    Article  Google Scholar 

  • Elvikis, D., & T’Kindt, V. (2014). Two-agent scheduling on uniform parallel machines with min-max criteria. Annals of Operations Research, 213(1), 79–94.

    Article  Google Scholar 

  • Elvikis, D., Hamacher, H. W., & T’Kindt, V. (2011). Scheduling two agents on uniform parallel machines with makespan and cost functions. Journal of Scheduling, 14(5), 471–481.

    Article  Google Scholar 

  • Gao, J. (2010). A novel artificial immune system for solving multiobjective scheduling problems subject to special process constraint. Computers & Industrial Engineering, 58, 602–609.

    Article  Google Scholar 

  • Gupta, J. N., & Ruiz-Torres, A. J. (2005). Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs. European Journal of Operational Research, 167(3), 679–695.

    Article  Google Scholar 

  • Gupta, J. N. D., & Ho, J. C. (2000). Minimizing flow time subject to optimal makespan on two identical parallel machines. Pesquisa Operacional, 20(1), 5–18.

    Article  Google Scholar 

  • Gupta, J. N. D., Ho, J. C., & Webster, S. (2000). Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines. Journal of the Operational Research Society, 51(11), 1330–1339.

    Article  Google Scholar 

  • Gao, J., He, G., & Wang, Y. (2009). A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint. The International Journal of Advanced Manufacturing Technology, 43(1–2), 151–160.

    Article  Google Scholar 

  • Graham, R., Lawler, E., Lenstra, J., & Rinnooy, K. A. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.

    Article  Google Scholar 

  • Hancer, E., Xue, B., Zhang, M., Karaboga, D., & Akay, B. (2018). Pareto front feature selection based on artificial bee colony optimization. Information Sciences, 422, 462–479.

    Article  Google Scholar 

  • Jia, Z. H., Zhang, Y. L., Leung, J. Y. T., & Li, K. (2017). Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines. Applied Soft Computing, 55, 226–237.

    Article  Google Scholar 

  • Karaboga, D. (2005). “An idea based on honey bee swarm for numerical optimization.” Technical report-tr06, Erciyes university, engineering faculty, computer engineering department.

  • Karaboga, D., & Akay, B. (2009). A comparative study of artificial bee colony algorithm. Applied Mathematics and Computation, 214(1), 108–132.

    Article  Google Scholar 

  • Kirkpatrick, S. C., Gelatt, C. D., & Vecchi, M. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680.

    Article  Google Scholar 

  • Lin, C. H., & Liao, C. J. (2003). Makespan minimization subject to flowtime optimality on identical parallel machines. Computers and Operations Research, 31, 1655–1666.

    Article  Google Scholar 

  • Lenstra, J. K., Kan, A. R., & Bricker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–362.

    Article  Google Scholar 

  • Li, J. Q., Pan, Q. K., & Gao, K. Z. (2011). Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. The International Journal of Advanced Manufacturing Technology, 55(9–12), 1159–1169.

    Article  Google Scholar 

  • Lin, S. W., & Ying, K. C. (2014). ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times. Computers & Operations Research, 51, 172–181.

    Article  Google Scholar 

  • Lin, Y. K. (2018). Scheduling efficiency on correlated parallel machine scheduling problems. Operational Research, 18(3), 603–624.

    Article  Google Scholar 

  • Lin, Y. K., & Lin, C. W. (2013). Dispatching rules for unrelated parallel machine scheduling with release dates. International Journal of Advanced Manufacturing Technology, 67, 269–279.

    Article  Google Scholar 

  • Lin, Y. K., & Lin, H. C. (2015). Bicriteria scheduling problem for unrelated parallel machines with release dates. Computers & Operations Research, 64, 28–39.

    Article  Google Scholar 

  • Lin, Y. K., Fowler, J. W., & Pfund, M. E. (2013). Multiple-objective heuristics for scheduling unrelated parallel machines. European Journal of Operational Research, 227(2), 239–253.

    Article  Google Scholar 

  • Lin, Y. K., Pfund, M. E., & Fowler, J. W. (2014). Processing time generation schemes for parallel machine scheduling problems with various correlation structures. Journal of Scheduling, 17(6), 569–586.

    Article  Google Scholar 

  • Mateo, M., Teghem, J., & Tuyttens, D. (2018). A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs. International Journal of Production Research, 56(3), 1030–1053.

    Article  Google Scholar 

  • Mladenovic, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24, 1097–1100.

    Article  Google Scholar 

  • Mönch, L., Balasubramanian, H., Fowler, J. W., & Pfund, M. E. (2005). Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers and Operations Research, 32, 2731–2750.

    Article  Google Scholar 

  • Nawaz, M. E., Jr., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91–95.

    Article  Google Scholar 

  • Pan, Q. K., Tasgetiren, M. F., Suganthan, P. N., & Chua, T. J. (2011). A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences, 181(12), 2455–2468.

    Article  Google Scholar 

  • Pinedo, M. (2016). Scheduling theory, algorithms, and systems. (5th ed.). Hoboken: Prentice Hall.

    Google Scholar 

  • Potts, C. N. (1985). Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Application Math, 10(2), 155–164.

    Article  Google Scholar 

  • Ruiz-Torres, A. J., Enscore, E. E., & Barton, R. R. (1997). Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem. Computers & Industrial Engineering, 33(1–2), 257–260.

    Article  Google Scholar 

  • Shahidi-Zadeh, B., Tavakkoli-Moghaddam, R., Taheri-Moghadam, A., & Rastgar, I. (2017). Solving a bi-objective unrelated parallel batch processing machines scheduling problem: A comparison study. Computers & Operations Research, 88, 71–90.

    Article  Google Scholar 

  • Sousa, J., & Wolsey, L. (1992). A time-indexed integer programming formulation for non-preemptive single machine scheduling problems. Mathematical Programming, 54(1–3), 353–367.

    Article  Google Scholar 

  • T’Kindt, V., & Billaut, J.-C. (2006). Multicriteria scheduling: Theory, models and algorithms (2nd ed.). Berlin: Springer.

    Google Scholar 

  • Tuzikov, A., Makhaniok, M., & Männer, R. (1998). Bicriterion scheduling of identical processing time jobs by uniform processors. Computers & Operations Research, 25(1), 31–35.

    Article  Google Scholar 

  • Ying, K. C., & Lin, S. W. (2012). Unrelated parallel machine scheduling with sequence-and machine-dependent setup times and due date constraints. International Journal of Innovative Computing, Information and Control, 8(5), 3279–3297.

    Google Scholar 

  • Zhang, R., Chang, P. C., Song, S., & Wu, C. (2017). A multi-objective artificial bee colony algorithm for parallel batch-processing machine scheduling in fabric dyeing processes. Knowledge-Based Systems, 116, 114–129.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Systems Management, Feng Chia University, Taichung, 40724, Taiwan, ROC

    Yang-Kuei Lin & Tzu-Yueh Yin

Authors
  1. Yang-Kuei Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tzu-Yueh Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yang-Kuei Lin.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lin, YK., Yin, TY. Generating bicriteria schedules for correlated parallel machines involving tardy jobs and weighted completion time. Ann Oper Res 319, 1655–1688 (2022). https://doi.org/10.1007/s10479-021-04043-x

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-021-04043-x

Keywords

Search

Navigation