Skip to main content

Advertisement

SpringerLink
Log in

Single machine interfering jobs problem with flowtime objective

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

Interfering jobs problems (or multi agents scheduling problems) are an emergent topic in the scheduling literature. In these decision problems, two or more sets of jobs have to be scheduled, each one with its own criteria. More specifically, we focus on a problem in which jobs belonging to two sets have to be scheduled in a single machine in order to minimize the total flowtime of the jobs in one set, while the total flowtime of the jobs in the other set should not exceed a given constant \(\epsilon \). This problem is known to be weakly NP-hard, and, in the literature, a dynamic programming (DP) algorithm has been proposed to find optimal solutions. In this paper, we first analyse the distribution of solutions of the problem in order to establish its empirical hardness. Next, a novel encoding scheme and a set of properties associated to the neighbourhood of this scheme are presented. These properties are used to develop both exact and approximate methods, i.e. a branch and bound (B&B) method, several constructive heuristics, and different versions of a genetic algorithm (GA). The computational experience carried out shows that the proposed B&B is more efficient than the existing DP algorithm. The results also show the advantages of the proposed encoding scheme, as the approximate methods yield close-to-optimum solutions for big-sized instances where exact methods are not feasible.

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
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  • Agnetis, A., De Pascale, G., & Pacciarelli, D. (2009). A lagrangian approach to single-machine scheduling problems with two competing agents. Journal of Scheduling, 12(4), 401–415.

    Article  Google Scholar 

  • Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52(2), 229–242.

    Article  Google Scholar 

  • Agnetis, A., Nicosia, G., Pacifici, A., & Pferschy, U. (2013). Two agents competing for a shared machine. In Algorithmic decision theory. Lecture Notes in Computer Science, vol. 8176, pp. 1–14. Springer Berlin Heidelberg.

  • Arbib, C., Smriglio, S., & Servilio, M. (2004). A competitive scheduling problem and its relevance to umts channel assignment. Networks, 44(2), 132–141.

    Article  Google Scholar 

  • Armentano, V. A., & Ronconi, D. P. (1999). Tabu search for total tardiness minimization in flowshop scheduling problems. Computers and Operations Research, 26(3), 219–235.

    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 

  • Bozejko, W. (2010). Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups. Journal of Intelligent Manufacturing, 21(6), 777–785. cited By 10.

    Article  Google Scholar 

  • Chang, H.-C., & Liu, T.-K. (2015). Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. Journal of Intelligent Manufacturing. cited By 0; Article in Press.

  • Chang, J. L., Gong, D. W., & Ma, X. P. (2007). A heuristic genetic algorithm for no-wait flowshop scheduling problem. Journal of China University of Mining and Technology, 17(4), 582–586.

    Article  Google Scholar 

  • Damodaran, P., Hirani, N. S., & Velez-Gallego, M. C. (2009). Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms. European Journal of Industrial Engineering, 3(2), 187–206.

    Article  Google Scholar 

  • Fan, J. (2010). Integrated production and delivery scheduling problem with two competing agents. In ICAMS 2010—proceedings of 2010 IEEE international conference on advanced management science, pp. 157–160.

  • Framinan, J. M. (2007). An adaptive branch and bound approach for transforming job shops into flow shops. Computers and Industrial Engineering, 52(1), 1–10.

    Article  Google Scholar 

  • Framinan, J. M. (2009). A fitness-based weighting mechanism for multicriteria flowshop scheduling using genetic algorithms. The International Journal of Advanced Manufacturing Technology, 43(9), 939–948.

    Article  Google Scholar 

  • Framinan, J. M., Leisten, R., & Ruiz, R. (2014). Manufacturing scheduling systems: An integrated view on models, methods, and tools. London (UK): Springer.

    Book  Google Scholar 

  • Framinan, J. M., Ruiz Usano, R., & Leisten, R. (2001). Sequencing conwip flow-shops: Analysis and heuristics. International Journal of Production Research, 39(12), 2735–2749.

    Article  Google Scholar 

  • Gawiejnowicz, S., Lee, W. C., Lin, C. L., & Wu, C. C. (2010). A branch-and-bound algorithm for two-agent single-machine scheduling of deteriorating jobs, pp. 207–211.

  • Hall, N. G., & Potts, C. N. (2004). Rescheduling for new orders. Operations Research, 52(3), 440–453.

    Article  Google Scholar 

  • Kellerer, H., & Strusevich, V. A. (2010). Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algoritmica, 57(4), 769–795.

    Article  Google Scholar 

  • Khelifati, S. L., & Bouzid-Sitayeb, F. (2011). A multi-agent scheduling approach for the joint scheduling of jobs and maintenance operations in the flow shop sequencing problem. In Lecture Notes in Computer Science, vol. 6923, LNAI(PART 2), pp. 60–69.

  • Khowala, K., Fowler, J., Keha, A., & Balasubramanian, H. (2014). Single machine scheduling with interfering job sets. Computers and Operations Research, 45, 97–107.

    Article  Google Scholar 

  • Li, D., Meng, X., Liang, Q., & Zhao, J. (2014). A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines. Journal of Intelligent Manufacturing, 1–18. cited By 0; Article in Press.

  • Li, D. C., & Hsu, P. H. (2012). Solving a two-agent single-machine scheduling problem considering learning effect. Computers and Operations Research, 39(7), 1644–1651.

    Article  Google Scholar 

  • Luo, H., Huang, G. Q., Zhang, Y., Dai, Q., & Chen, X. (2009). Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm. Robotics and Computer-Integrated Manufacturing, 25(6), 962–971.

    Article  Google Scholar 

  • Meiners, C. R., & Torng, E. (2007). Mixed criteria packet scheduling. Lecture Notes in Computer Science, 4508, 120–133.

    Article  Google Scholar 

  • Mu, Y., & Gu, C. (2010). Rescheduling to minimize makespan under a limit on the makespan of the original jobs. In The 2nd international conference on computer and automation engineering, ICCAE 2010, vol. 1, pp. 613–617.

  • Ni, Y., & Zhao, Z. (2014). Two-agent scheduling problem under fuzzy environment. Journal of Intelligent Manufacturing. cited By 0; Article in Press.

  • Peha, J. M. (1995). Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time. Computers and Operations Research, 22(10), 1089–1100.

    Article  Google Scholar 

  • Peha, J. M., & Tobagi, F. A. (1990). Evaluating scheduling algorithms for traffic with heterogeneous performance objectives. In Global telecommunications conference, 1990, and exhibition. ’Communications: Connecting the future’, GLOBECOM ’90., IEEE, pp. 21–27.

  • Perez-Gonzalez, P., & Framinan, J. M. (2009). Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics. Computers and Operations Research, 36(10), 2866–2876.

    Article  Google Scholar 

  • Perez-Gonzalez, P., & Framinan, J. M. (2010). Setting a common due date in a constrained flowshop: A variable neighbourhood search approach. Computers and Operations Research, 37(10), 1740–1748.

    Article  Google Scholar 

  • Perez-Gonzalez, P., & Framinan, J. M. (2014). A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems. European Journal of Operational Research, 235(1), 1–16.

    Article  Google Scholar 

  • Pinedo, M. (1995). Scheduling: Theory, algorithms, and systems. Englewood Cliffs, NJ: Prentice Hall International Series in Industrial and System Engineering. Prentice Hall.

    Google Scholar 

  • Ruiz, R., & Allahverdi, A. (2007). No-wait flowshop with separate setup times to minimize maximum lateness. The International Journal of Advanced Manufacturing Technology, 35(5), 551–565.

    Article  Google Scholar 

  • Ruiz, R., & Allahverdi, A. (2009). Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness. Computers and Operations Research, 36(4), 1268–1283.

    Article  Google Scholar 

  • Ruiz, R., & Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169(3), 781–800.

    Article  Google Scholar 

  • Ruiz, R., Maroto, C., & Alcaraz, J. (2005). Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. European Journal of Operational Research, 165(1), 34–54.

  • Sabouni, M., Jolai, F., & Mansouri, A. (2010). Heuristics for minimizing total completion time and maximum lateness on identical parallel machines with setup times. Journal of Intelligent Manufacturing, 21(4), 439–449. cited By 4.

  • Soltani, R., Jolai, F., & Zandieh, M. (2010). Two robust meta-heuristics for scheduling multiple job classes on a single machine with multiple criteria. Expert Systems with Applications, 37(8), 5951–5959.

    Article  Google Scholar 

  • Taillard, E. D. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47(1), 65–74.

    Article  Google Scholar 

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

    Book  Google Scholar 

  • Tseng, L. Y., & Lin, Y. T. (2010). A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem. International Journal of Production Economics, 127(1), 121–128.

    Article  Google Scholar 

  • Unal, A. T., Uzsoy, R., & Kiran, A. S. (1997). Rescheduling on a single machine with part-type dependent setup times and deadlines. Annals of Operations Research, 70, 93–113.

    Article  Google Scholar 

  • Ventura, J., & Yoon, S.-H. (2013). A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers. Journal of Intelligent Manufacturing, 24(6), 1185–1196. cited By 7.

    Article  Google Scholar 

  • Wan, G., Vakati, S. R., Leung, J. Y. T., & Pinedo, M. L. (2010). Scheduling two agents with controllable processing times. European Journal of Operational Research, 205(3), 528–539.

    Article  Google Scholar 

  • Wu, W.-H., Cheng, S.-R., Wu, C.-C., & Yin, Y. (2012). Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations. Journal of Intelligent Manufacturing, 23(5), 1985–1993. cited By 0.

    Article  Google Scholar 

  • Yao, L., Shi, H., Liu, C., & Han, Z. (2011). Solving the two-objective shop scheduling problem in mto manufacturing systems by a novel genetic algorithm. Advanced Materials Research, 314–316, 1315–1320.

    Article  Google Scholar 

  • Yuan, J., & Mu, Y. (2007). Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption. European Journal of Operational Research, 182(2), 936–944.

    Article  Google Scholar 

  • Yuan, J., Mu, Y., Lu, L., & Li, W. (2007). Rescheduling with release dates to minimize total sequence disruption under a limit on the makespan. Asia-Pacific Journal of Operational Research, 24(6), 789–796.

    Article  Google Scholar 

  • Yuan, J. J., Ng, C. T., & Cheng, T. C. E. (2015). Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness. Journal of Scheduling, 18(2), 147–153.

Download references

Acknowledgments

The authors are sincerely grateful to the anonymous referees, who provide very valuable comments on the earlier version of the paper. This research has been funded by the Spanish Ministry of Science and Innovation, under projects “SCORE” with reference DPI2010-15573/DPI, and “ADDRESS” with reference DPI2013-44461-P/DPI.

Author information

Authors and Affiliations

  1. Industrial Management, University of Seville, Sevilla, Spain

    Paz Perez-Gonzalez & Jose M. Framinan

Authors
  1. Paz Perez-Gonzalez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jose M. Framinan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paz Perez-Gonzalez.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Perez-Gonzalez, P., Framinan, J.M. Single machine interfering jobs problem with flowtime objective. J Intell Manuf 29, 953–972 (2018). https://doi.org/10.1007/s10845-015-1141-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-015-1141-6

Keywords

Search

Navigation