Skip to main content

Advertisement

SpringerLink
Log in

Metaheuristics for a scheduling problem with rejection and tardiness penalties

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

In this paper, we consider a single-machine scheduling problem (P) inspired from manufacturing instances. A release date, a deadline, and a regular (i.e., non-decreasing) cost function are associated with each job. The problem takes into account sequence-dependent setup times and setup costs between jobs of different families. Moreover, the company has the possibility to reject some jobs/orders, in which case a penalty (abandon cost) is incurred. Therefore, the problem at hand can be viewed as an order acceptance and scheduling problem. Order acceptance problems have gained interest among the research community over the last decades, particularly in a make-to-order environment. We propose and compare a constructive heuristic, local search methods, and population-based algorithms. Tests are performed on realistic instances and show that the developed metaheuristics significantly outperform the currently available resolution methods for the same problem.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Akturk, M. S., & Ozdemir, D. (2000). An exact approach to minimizing total weighted tardiness with release dates. IIE Transactions, 32, 1091–1101.

    Article  Google Scholar 

  • Akturk, M. S., & Ozdemir, D. (2001). A new dominance rule to minimize total weighted tardiness with unequal release dates. European Journal of Operational Research, 135(2), 394–412.

    Article  Google Scholar 

  • Anghinolfi, D., & Paolucci, M. (2007). Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Computers & Operations Research, 34(11), 3471–3490.

    Article  Google Scholar 

  • Baptiste, P., & Le Pape, C. (2005). Scheduling a single machine to minimize a regular objective function under setup constraints. Discrete Optimization, 2(1), 83–99.

    Article  Google Scholar 

  • Bilgintürk Yalçın, Z., Oğuz, C., & Salman Sibel, F. (2007). Order acceptance and scheduling decisions in make-to-order systems. In Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Application (MISTA 2007) (pp. 80–87). Paris.

  • Bo, L., Ling, W., Ying, L., & Shouyang, W. (2011). A unified framework for population-based metaheuristics. Annals of Operations Research, 186(32), 231–262.

    Google Scholar 

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

    Article  Google Scholar 

  • Cesaret, B., Oğuz, C., & Sibel Salman, F. (2012). A tabu search algorithm for order acceptance and scheduling. Computers & Operations Research, 39(6), 1197–1205. Special Issue on Scheduling in Manufacturing Systems.

    Article  Google Scholar 

  • Du, J., & Leung, J. Y. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483–495.

    Article  Google Scholar 

  • Gendreau, M., & Potvin, J.-Y. (2010). Handbook of Metaheuristics (2nd ed.). New York: Springer.

    Book  Google Scholar 

  • Goslawski, M., Józefowska, J., Kulus, M., & Nossack, J. (2014). Scheduling orders with mold setups in an injection plant. In Proceedings of the 14th International Workshop on Project Management and Scheduling, PMS 2014, Munich, Germany.

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

    Article  Google Scholar 

  • Harrison, S.A., Philpott, M.S., & Price, M.E. (1999). Task scheduling for satellite based imagery. In Proceedings of the 18th Workshop of the UK Planning and Scheduling Special Interest Group (pp. 64–78) Salford: University of Salford.

  • Hertz, A., & Kobler, D. (2000). A framework for the description of evolutionary algorithms. European Journal of Operational Research, 126, 1–12.

    Article  Google Scholar 

  • Hsu, H. M., Hsiung, Y., Chen, Y. Z., & Wu, M. C. (2009). A GA methodology for the scheduling of yarn-dyed textile production. Expert Systems with Applications, 36(10), 12,095–12,103.

    Article  Google Scholar 

  • Jouglet, A., Savourey, D., Carlier, J., & Baptiste, P. (2008). Dominance-based heuristics for one-machine total cost scheduling problems. European Journal of Operational Research, 184(3), 879–899.

    Article  Google Scholar 

  • Kellegöz, T., Toklu, B., & Wilson, J. (2008). Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem. Applied Mathematics and Computation, 199(2), 590–598.

    Article  Google Scholar 

  • Kirlik, G., & Oğuz, C. (2012). A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. Computers and Operations Research, 39(7), 1506–1520.

    Article  Google Scholar 

  • Laguna, M., Barnes, J. W., & Glover, F. (1991). Tabu search methods for a single machine scheduling problem. Journal of Intelligent Manufacturing, 2, 63–73.

    Article  Google Scholar 

  • Le Pape, C. (2007). A Test Bed for Manufacturing Planning and Scheduling Discussion of Design Principles. In Proceedings of the International Workshop on Scheduling a Scheduling Competition, Providence Rhode Island USA.

  • Lee, Y. H., Bhaskaran, K., & Pinedo, M. (1997). A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29(1), 45–52.

    Article  Google Scholar 

  • Lemaitre, M., Verfaillie, G., Jouhaud, F., Lachiver, J. M., & Bataille, N. (2002). Selecting and scheduling observations of agile satellites. Aerospace Science and Technology, 6, 367–381.

    Article  Google Scholar 

  • Lü, Z., Glover, F., & Hao, J.K. (2009). Neighborhood combination for unconstrained binary quadratic problems. In Proceedings of the 8th Metaheuristic International Conference. Hamburg, Germany, 13–16 July, 2009.

  • Nagarur, N., Vrat, P., & Duongsuwan, W. (1997). Production planning and scheduling for injection moulding of pipe fittings a case study. International Journal of Production Economics, 53(2), 157–170.

    Article  Google Scholar 

  • Nobibon, F. T., & Leus, R. (2011). Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment. Computers & Operations Research, 38, 367–378.

    Article  Google Scholar 

  • Nobibon, F.T., Herbots, J., & Leus, R. (2009). Order acceptance and scheduling in a single-machine environment: Exact and heuristic algorithms. In Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2009), Dublin, Ireland.

  • Nuijten, W., Bousonville, T., Focacci, F., Godard, D., & Le Pape, C. (2004). Towards an industrial manufacturing scheduling problem and test bed. In Proceedings of Project Management and Scheduling (PMS 2004), Nancy (pp. 162–165).

  • Oğuz, C., Sibel Salman, F., & Bilgintürk Yalçın, Z. (2010). Order acceptance and scheduling decisions in make-to-order systems. International Journal of Production Economics, 125(1), 200–211.

    Article  Google Scholar 

  • Pinedo, M. (2008). Scheduling: Theory, algorithms, and systems. Berlin: Springer.

    Google Scholar 

  • Potts, C. N., & van Wassenhove, L. N. (1985). A branch and bound algorithm for the total weighted tardiness problem. Operations Research, 33(2), 363–377.

    Article  Google Scholar 

  • Ribeiro, F., de Souza, S., Souza, M., & Gomes, R. (2010). An adaptive genetic algorithm to solve the single machine scheduling problem with earliness and tardiness penalties. In IEEE Congress on Evolutionary Computation (CEC) (pp. 1–8).

  • Rochat, Y., & Taillard, E. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1, 147–167.

    Article  Google Scholar 

  • Rom, W. O., & Slotnick, S. A. (2009). Order acceptance using genetic algorithms. Computers & Operations Research, 36(6), 1758–1767.

    Article  Google Scholar 

  • Sels, V., & Vanhoucke, M. (2011). A hybrid dual-population genetic algorithm for the single machine maximum lateness problem. Lecture Notes in Computer Science, 6622, 14–25.

    Article  Google Scholar 

  • Shabtay, D., Gaspar, N., & Yedidsion, L. (2012). A bicriteria approach to scheduling a single machine with job rejection and positional penalties. Journal of Combinatorial Optimization, 23(4), 395–424.

    Article  Google Scholar 

  • Shin, H. J., Kim, C. O., & Kim, S. S. (2002). A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times. The International Journal of Advanced Manufacturing Technology, 19, 859–866.

    Article  Google Scholar 

  • Slotnick, S. A. (2011). Order acceptance and scheduling: A taxonomy and review. European Journal of Operational Research, 212(1), 1–11.

    Article  Google Scholar 

  • Taillard, E. D., Gambardella, L. M., Gendreau, M., & Potvin, J. Y. (2001). Adaptive memory programming: A unified view of metaheuristics. European Journal of Operational Research, 135, 1–16.

  • Thevenin, S., Zufferey, N., & Widmer, M. (2012). Tabu search for a single machine scheduling problem with rejected jobs, setups and deadlines. In 9th International Conference of Modeling, Optimization and SIMulation (MOSIM 2012), Bordeaux.

  • Vepsalainen, A. P. J., & Morton, T. E. (1987). Priority rules for job shops with weighted tardiness costs. Management Science, 33(8), 1035–1047.

    Article  Google Scholar 

  • Wei-Cheng, L., & Chang, S. C. (2005). Hybrid algorithms for satellite imaging scheduling. Systems, Man and Cybernetics, Hawaii, USA, 3, 2518–2523.

    Google Scholar 

  • Wu, Q., Hao, J. K., & Glover, F. (2012). Multi-neighborhood tabu search for the maximum weight clique problem. Annals of Operations Research, 196, 611–634.

    Article  Google Scholar 

  • Xiao, Y. Y., Zhang, R. Q., Zhao, Q. H., & Kaku, I. (2012). Permutation flow shop scheduling with order acceptance and weighted tardiness. Applied Mathematics and Computation, 218(15), 7911–7926.

  • Yang, B., & Geunes, J. (2007). A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times. Computers & Industrial Engineering, 53(3), 420–432.

    Article  Google Scholar 

  • Zhang, L., Lu, L., & Yuan, J. (2009). Single machine scheduling with release dates and rejection. European Journal of Operational Research, 198(3), 975–978.

    Article  Google Scholar 

  • Zorzini, M., Corti, D., & Pozzetti, A. (2008). Due date (dd) quotation and capacity planning in make-to-order companies: Results from an empirical analysis. International Journal of Production Economics, 112(2), 919–933.

  • Zufferey, N. (2012). Metaheuristics: Some principles for an efficient design. Computer Technology and Application, 3, 446–462.

  • Zufferey, N., Amstutz, P., & Giaccari, P. (2008). Graph colouring approaches for a satellite range scheduling problem. Journal of Scheduling, 11(4), 263–277.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Geneva School of Economics and Management (GSEM), University of Geneva, Geneva, Switzerland

    Simon Thevenin & Nicolas Zufferey

  2. DIUF Decision Support & Operations Research, University of Fribourg, Fribourg, Switzerland

    Marino Widmer

Authors
  1. Simon Thevenin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolas Zufferey
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marino Widmer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicolas Zufferey.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Thevenin, S., Zufferey, N. & Widmer, M. Metaheuristics for a scheduling problem with rejection and tardiness penalties. J Sched 18, 89–105 (2015). https://doi.org/10.1007/s10951-014-0395-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-014-0395-8

Keywords

Search

Navigation