Skip to main content
SpringerLink
Log in

Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines

  • Intellectual Control Systems, Data Analysis
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

A set of jobs has to be processed on parallel machines. For each job, there are given a release time and a due date and the job must be processed no later than its due date. If the job will be completed no later than the given due date, a benefit will be earned. Otherwise, this job will be rejected and the benefit will be discarded. The criterion under consideration is to maximize the weighted sum of the benefits and the number of jobs processed in time. Some properties of the objective function are found which allow to construct a optimal schedule. We develop a simulated annealing algorithm, a tabu search algorithm, and a genetic algorithm for solving this problem. The developed algorithms were tested on moderate and large instances with up to 500 jobs and 50 machines. Some recommendations are given showing how to use the obtained results and developed algorithms in production planning.

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

Similar content being viewed by others

References

  1. Brucker, P., Sotskov, Y.N., and Werner, F., Complexity of Shop–Scheduling Problems with Fixed Number of Jobs: A Survey, Math. Methods Oper. Res., 2007, vol. 65, no. 3, pp. 461–481.

    Article  MathSciNet  MATH  Google Scholar 

  2. Graham, R.E., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan A.H.G., Optimization and Approximation in Deterministic Sequencing and Scheduling a Survey, Ann. Discret. Math., 1979, vol. 4, pp. 287–326.

    Article  MathSciNet  MATH  Google Scholar 

  3. Anglani, A., Grieco, A., Guerriero, E., and Musmanno, R., Robust Scheduling of Parallel Machines with Sequence–Dependent Set–up Cost, Eur. J. Oper. Res., 2005, vol. 161, no. 3, pp. 704–720.

    Article  MathSciNet  MATH  Google Scholar 

  4. Feng, G. and Lau, H.C., Efficient Algorithm for Machine Scheduling Problems with Earliness and Tardiness Penalties, Ann. Oper. Res., 2008, vol. 159, no. 1, pp. 83–95.

    Article  MathSciNet  MATH  Google Scholar 

  5. Berrichi, A. and Yalaoui, F., Efficient Bi–Objective ant Colony Approach to Minimize Total Tardiness and System Unavailability for a Parallel Machine Scheduling Problem, Int. J. Adv. Manuf. Technol., 2013, vol. 68, no. 9–12, pp. 2295–2310.

    Google Scholar 

  6. Lin, Y.K. and Lin, C.W., Dispatching Rules for Unrelated Parallel Machine Scheduling with Release Dates, Int. J. Adv. Manuf. Technol., 2013, vol. 67, no. 1–4, pp. 269–279.

    Google Scholar 

  7. Balin, S., Non–Identical Parallel Machine Scheduling Using Genetic Algorithm, Expert Syst. Appl., 2011, vol. 38, no. 6, pp. 6814–6821.

    Article  Google Scholar 

  8. Juraszek, J., Sterna, M., and Pesch, E., Revenue Maximization on Parallel Machines, Institute of Computing Science, Poznan University of Technology, pp. 960–965, Poznan, Poland.

  9. Carter, M.W. and Price, C.C., Operations Research: A Practical Introduction, Textbook, Boca Raton: CRC Press, 2001.

    MATH  Google Scholar 

  10. Balin, S., Non–Identical ParallelMachine Scheduling with Fuzzy Processing Times Using Robust Genetic Algorithm and Simulation, Int. J. Innovat. Comput. Inform. Control, 2012, vol. 8, no. 1–B, pp. 727–745.

    Google Scholar 

  11. Li, K. and Yang, S.–L., Non–Identical Parallel–Machine Scheduling Research with Minimizing Total Weighted Completion Times: Models, Relaxations and Algorithms, Appl. Math. Modell., 2009, vol. 33, no. 4, pp. 2145–2158.

    Article  MathSciNet  MATH  Google Scholar 

  12. Xu, S. and Bean, J.C., A Genetic Algorithm for Scheduling Parallel Non–Identical Batch Processing Machines, Comput. Intelligen. Scheduling, SCIS’ 07, IEEE Sympos., 2007, pp. 143–150.

    Google Scholar 

  13. Rodriguez, F., Blum, C., Garcia–Martinez, C., and Lozano, M., GRASP with Path–Relinking for the Non–Identical Parallel Machine Scheduling Problem with Minimising TotalWeighted Completion Times, Ann. Oper. Res., 2012, vol. 201, no. 1, pp. 383–401.

    Article  MathSciNet  MATH  Google Scholar 

  14. Supithak, W. and Plongon, K., Memetic Algorithm for Non–Identical Parallel Machines Scheduling Problem with Earliness and Tardiness Penalties, Int. J. Manuf. Technol. Manage., 2011, vol. 22, no. 1, pp. 26–38.

    Article  Google Scholar 

  15. Logendran, R., McDonell, B., and Smuckera, B., Scheduling Unrelated ParallelMachines with Sequence–Dependent Setups, Comput. Oper. Res., 2007, vol. 34, no. 11, pp. 3420–3438.

    Article  MathSciNet  MATH  Google Scholar 

  16. Anagnostopoulos, G. and Rabadi, G., A Simulated Annealing Algorithm for the Unrelated Parallel Machine Scheduling Problem, Proc. 5th Biannual World Autom. Congr. 2002, 2002, vol. 14, pp. 115–120.

    Article  Google Scholar 

  17. Sivrikaya–Serifoglu, F. and Ulusoy, G., Parallel Machine Scheduling with Earliness and Tardiness Penalties, Comput. Oper. Res., 1999, vol. 26, no. 8, pp. 773–787.

    Article  MathSciNet  MATH  Google Scholar 

  18. Bilge, U., Kirac, F., Kurtulan, M., and Pekgun, P., A Tabu Search Algorithm for Parallel Machine Total Tardiness Problem, Comput. Oper. Res., 2004, vol. 31, no. 3, pp. 397–414.

    Article  MATH  Google Scholar 

  19. Tavakkoli–Moghaddam, R., Taheri, F., and Bazzazi, M., Multi–Objective Unrelated Machines Scheduling with Sequence–Dependent Setup Times and Precedence Constrains, IEE Transactions A: Basics, 2008, vol. 21, no. 3, pp. 269–278.

    Google Scholar 

  20. Dunstall, S. and Wirth, A., Heuristic Methods for the Identical Parallel Machine Problem with Set–up Times, Comput. Oper. Res., 2005, vol. 32, no. 9, pp. 2479–2491.

    Article  MATH  Google Scholar 

  21. Sterna, M., Juraszek, J., and Pesch, E., Revenue Maximization on Parallel Machines, Book Chapter, Oper. Res. Proc., 2008, pp. 153–158.

    MATH  Google Scholar 

  22. Islam, M., Khanna, G., and Sadayappan, P., Revenue Maximization in Market–Based Parallel Job Schedulers, Technical Report, Ohio State University, OSU–CISRC–4/08–TR16, Ohio, USA, 2008, pp. 1–13.

    Google Scholar 

  23. Dawande, M., Drobouchevitch, I., Rajapakshe, T., and Sriskandarajah, C., Analysis of Revenue Maximazation under Two Movie–Screening Policies, Product. Oper. Manage., 2010, vol. 19, no. 1, pp. 111–124.

    Article  Google Scholar 

  24. Feng, G., Garg, S., Buyya, R., and Li, W., Revenue Maximization Using Adaptive Resource Provisioning in Cloud Computing Environments, ASM/IEEE 13th Int. Conf. Grid Comput., IEEE Comput. Soc., 2012, pp. 192–200. DOI 10.1109/Grid.2012.16

    Google Scholar 

  25. Glover, F., Future Paths for Integer Programming and Links to Artificial Intelligence, Comput. Oper. Res., 1986, vol. 13, no. 5, pp. 533–549.

    Article  MathSciNet  MATH  Google Scholar 

  26. Sotskov, Y.N. and Lai, T.-C., Minimizing Total Weighted Flow Time under Uncertainty Using Dominance and a Stability Box, Comput. Oper. Res., 2012, vol. 39, no. 6, pp. 1271–1289.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Blekinge Institute of Technology, Karlskrona, Sweden

    O. Gholami

  2. United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus

    Y. N. Sotskov

  3. Otto-von-Guericke-University, Magdeburg, Germany

    F. Werner

  4. “Servolux,”, Mogilev, Belarus

    A. S. Zatsiupo

Authors
  1. O. Gholami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. N. Sotskov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. Werner
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. A. S. Zatsiupo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to O. Gholami, Y. N. Sotskov, F. Werner or A. S. Zatsiupo.

Additional information

Russian Text © O. Gholami, Y.N. Sotskov, F. Werner, A.S. Zatsiupo, 2019, published in Avtomatika i Telemekhanika, 2019, No. 2, pp. 125–151.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gholami, O., Sotskov, Y.N., Werner, F. et al. Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines. Autom Remote Control 80, 297–316 (2019). https://doi.org/10.1134/S0005117919020085

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117919020085

Keywords

Search

Navigation