Abstract
This paper presents a simple and effective iterated greedy heuristic to minimize the total tardiness in a single-machine scheduling problem. In this problem the jobs are classified in families and setup times are required between the processing of two jobs of different families. Each job requires a certain amount of resource that is supplied through upstream processes. The total resource consumed must not exceed the resource supply up. Therefore, jobs may have to wait and the machine has to be idle due to an insufficient availability of the resource. The iterated greedy heuristic is tested over an extensive computational experience on benchmark of instances from the literature and randomly generated in this work. Results show that the developed heuristic significantly outperforms a state-of-the-art heuristic in terms of solution quality.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Allahverdi, A., Ng, C., Cheng, T.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985–1032 (2008)
Bigras, L.-P., Gamache, M., Savard, G.: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discret. Optim. 5(4), 685–699 (2008)
Briskorn, D., Choi, B.-C., Lee, K., Leung, J., Pinedo, M.: Complexity of single machine scheduling subject to nonnegative inventory constraints. Eur. J. Oper. Res. 207(2), 605–619 (2010)
Briskorn, D., Jaehn, F., Pesch, E.: Exact algorithms for inventory constrained scheduling on a single machine. J. Sched. 16(1), 105–115 (2013)
Du, J., Leung, J.Y.-T.: Minimizing total tardiness on one machine is np-hard. Math. Oper. Res. 15(3), 483–495 (1990)
Emmons, H.: One-machine sequencing to minimize certain functions of job tardiness. Oper. Res. 17(4), 701–715 (1969)
Fanjul-Peyro, L., Ruiz, R.: Iterated greedy local search methods for unrelated parallel machine scheduling. Eur. J. Oper. Res. 207(1), 55–69 (2010)
Gupta, J.N., Chantaravarapan, S.: Single machine group scheduling with family setups to minimize total tardiness. Int. J. Prod. Res. 46(6), 1707–1722 (2008)
Gupta, S.R., Smith, J.S.: Algorithms for single machine total tardiness scheduling with sequence dependent setups. Eur. J. Oper. Res. 175(2), 722–739 (2006)
Herr, O., Goel, A.: Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints. Eur. J. Oper. Res. 248(1), 123–135 (2016)
Koulamas, C.: The single-machine total tardiness scheduling problem: review and extensions. Eur. J. Oper. Res. 202(1), 1–7 (2010)
Lawler, E.L.: A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Ann. Discret. Math. 1, 331–342 (1977)
Liao, C.-J., Juan, H.-C.: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Comput. Oper. Res. 34(7), 1899–1909 (2007)
Lin, S., Ying, K.: A hybrid approach for single-machine tardiness problems with sequence-dependent setup times. J. Oper. Res. Soc. 59(8), 1109–1119 (2008)
Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228–249 (2000)
Potts, C.N., Van Wassenhove, L.N.: Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J. Oper. Res. Soc. 43(5), 395–406 (1992)
Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033–2049 (2007)
Schaller, J.: Scheduling on a single machine with family setups to minimize total tardiness. Int. J. Prod. Econ. 105(2), 329–344 (2007)
Schaller, J.E., Gupta, J.N.: Single machine scheduling with family setups to minimize total earliness and tardiness. Eur. J. Oper. Res. 187(3), 1050–1068 (2008)
Sen, T., Sulek, J.M., Dileepan, P.: Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art survey. Int. J. Prod. Econ. 83(1), 1–12 (2003)
Sioud, A., Gravel, M., Gagné, C.: A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 39(10), 2415–2424 (2012)
Subramanian, A., Battarra, M., Potts, C.N.: An iterated local search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times. Int. J. Prod. Res. 52(9), 2729–2742 (2014)
Tanaka, S., Araki, M.: An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. Comput. Oper. Res. 40(1), 344–352 (2013)
Jacob, V.V., Arroyo, J.E.C.: ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness. J. Appl. Math. 2016 (2016)
Ying, K.-C., Lin, S.-W., Huang, C.-Y.: Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Exp. Syst. Appl. 36(3), 7087–7092 (2009)
Acknowledgments
The authors thanks the financial support of FAPEMIG, CAPES and CNPq, Brazilian research agencies.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Pinheiro, J.C.S.N., Arroyo, J.E.C., Tavares, R.G. (2019). An Effective Heuristic for a Single-Machine Scheduling Problem with Family Setups and Resource Constraints. In: Battiti, R., Brunato, M., Kotsireas, I., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 12 2018. Lecture Notes in Computer Science(), vol 11353. Springer, Cham. https://doi.org/10.1007/978-3-030-05348-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-05348-2_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05347-5
Online ISBN: 978-3-030-05348-2
eBook Packages: Computer ScienceComputer Science (R0)