Abstract
This paper presents two hybrid metaheuristic approaches, viz. a hybrid genetic algorithm and a hybrid artificial bee colony algorithm for a single machine scheduling problem where tardiness cost of a job increases stepwise with various due dates and the objective is to minimize the total tardiness cost. This kind of tardiness cost occurs in several real life scenarios particularly in transportation. Two versions of the scheduling problem are considered. In the first version, all jobs are assumed to be available for processing at the beginning, whereas in the latter version jobs have release dates. For both versions, we have employed a local search to further improve the solutions obtained through our metaheuristic approaches. To the best of our knowledge, our approaches are the first metaheuristic approaches for the latter version of the problem. For the first version, we have compared our approaches with the state-of-the-art approaches available in the literature. Computational results show the superiority of our approaches over previous approaches in terms of solution quality and running time both. For the latter version, hybrid artificial bee colony algorithm based approach outperformed the hybrid genetic algorithm based approach in terms of solution quality and running time both.
Similar content being viewed by others
References
Beasley JE, Chu PC (1996) A genetic algorithm for the set covering problem. European Journal of Operational Research 94:394–404
Birbil I, Fang SC (2003) An electromagnetism-like mechanism for global optimization. Journal of Global Optimization 30:263–282
Chang PC, Chen SH, Fan CY (2009) A hybrid electromagnetism-like algorithm for single machine scheduling problem. Expert Systems with Applications 36:1259–1267
Curry J, Peters B (2005) Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives. International Journal of Production Research 43(15):3231–3246
Davis L (1991) Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York
Detienne B, Dauzère-Pérès S, Yugma C (2009) Scheduling in section operations subject to a fixed production schedule. In: Proceedings of the \(4{\rm th}\) Multidisciplinary International Conference (MISTA2009). Dublin, Ireland, pp 581–593
Detienne B, Dauzère-Pérès S, Yugma C (2011) Scheduling jobs on parallel machines to minimize a regular step total cost function. Journal of Scheduling 14:523–538
Detienne B, Dauzère-Pérès S, Yugma C (2012) An exact approach for scheduling jobs with regular step cost functions on a single machine. Computer and Operations Research 39:1033–1043
Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. In: Proceedings of the 1991 Conference on Foundations of Genetic Algorithms. Morgan Kaufmann, pp 69–93
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics 4:287–326
Janiak A, Krysiak T (2007) Single processor scheduling with job values depending on their completion times. Journal of Scheduling 10:129–138
Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report TR06. Computer Engineering Department, Erciyes University, Turkey
Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization 39:459–471
Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing 8:687–697
Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artificial Intelligence Review 42(1):21–57
Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Annals of Discrete Mathematics 1:343–362
Liang H, Yao X, Newton C, Hoffman D (2002) A new evolutionary approach to cutting stock problems with and without contiguity. Computers and Operations Research 29:1641–1659
M’Hallah R, Bulfin RL (2003) Minimizing the weighted number of tardy jobs on a single machine. European Journal of Operational Research 145:45–56
M’Hallah R, Bulfin RL (2007) Minimizing the weighted number of tardy jobs on a single machine with release dates. European Journal of Operational Research 176:727–744
Moore MJ (1968) An \(n\) job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15(1):102–109
Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega 11:91–95
Pan QK, Tasgetiren MF, Suganthan PN, Chua TJ (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences 181:2455–2468
Ruiz R, Maroto C, Alcaraz J (2006) Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34(5):461–476
Sahin G (2006) New combinatorial approaches for solving railroad planning and scheduling problems. Ph.D. Dissertation. University of Florida
Seddik Y, Gonzales C, Kedad-Sidhoum S (2015) Performance guarantees for a scheduling problem with common stepwise job payoffs. Theoretical Computer Science 562:377–394
Sevaux M, Dauzère-Pérès S (2003) Genetic algorithms to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research 151:296–306
Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Applied Soft Computing 9:625–631
Sundar S, Singh A (2012) A swarm intelligence approach to the early/tardy scheduling problem. Swarm and Evolutionary Computation 4:25–32
Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2006) Particle swarm optimization and differentialevolution for the single machine total weighted tardiness problem. International Journal of Production Research 44(22):4737–4754
Tseng CT, Chen KH (2013) An electromagnetism-like mechanism for the single machine total stepwise tardiness problem with release dates. Engineering Optimization 45(12):1431–1448
Villareal FJ, Bulfin RL (1983) Scheduling a single machine to minimize the weighted number of tardy jobs. IIE Transactions 15:337–343
Acknowledgments
Authors would like to thank Dr. C.-T. Tseng for providing the test instances and their solutions obtained through various approaches. Authors are also grateful to three anonymous reviewers for their valuable comments and suggestions which helped in improving the quality of this manuscript.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chaurasia, S.N., Sundar, S. & Singh, A. Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates. Oper Res Int J 17, 275–295 (2017). https://doi.org/10.1007/s12351-016-0225-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-016-0225-1
Keywords
- Single machine total stepwise tardiness problem
- Artificial bee colony algorithm
- Genetic algorithm
- Heuristic
- Release dates
- Scheduling