Abstract
In this paper, we develop a new evolutionary algorithm called League Championship Algorithm (LCA) to solve a new single machine scheduling nonlinear problem in JIT environment with batch delivery cost and distinct due dates. Despite its hardness, solving a non-convex function which minimizes earliness and tardiness costs simultaneously seems to be very useful and practical in industrial environments. In order to solve this complex problem, first we present a mathematical model and then design a new discrete nonlinear version of the LCA algorithm which is very efficient and helpful in combinatorial problems, either in terms of computational time or solution quality.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cheng, T.C.E., Kahlbacher, H.G.: Scheduling with Delivery and Earliness Penalties. Asia-Pacific Journal of Operational Research 10, 145–152 (1993)
Cheng, T.C.E., Gordon, V.S.: Batch Delivery Scheduling on A Single Machine. Journal of the Operational Research Society 45, 121–1215 (1994)
Chris, N.P., Mikhail, Y.K.: Scheduling with Batching: A Review. European Journal of Operational Research 120, 228–249 (2000)
Guruprasad, P., Chen, Z.L.: Scheduling a Production–Distribution System To Optimize the Tradeoff between Delivery Tardiness and Distribution Cost. Naval Research Logistics 52, 571–589 (2005)
Mohammad, M.M., Sara, S., Armin, A., Khalil, S.H.: Single-machine Batch Scheduling Minimizing Weighted Flow Times and Delivery Costs. Applied Mathematical Modelling 35, 563–570 (2011)
Dvir, S.: Scheduling and Due Date Assignment to Minimize Earliness, Tardiness, Holding, Due Date Assignment and Batch Delivery Costs. Int. J. Production Economics. 123, 235–242 (2010)
Chang, P.C., Chen, S.S., Fan, C.Y.: Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems. Applied Soft Computing 8, 767–777 (2008)
Tsai, T.I.: A Genetic Algorithm for Solving the Single Machine Earliness/Tardiness Problem with Distinct Due Dates and Ready Times. Int. J. Adv. Manuf. Technol. 31, 994–1000 (2007)
Jou, C.: A Genetic Algorithm with Sub-indexed Partitioning Genes and Its Application to Production Scheduling of Parallel Machines. Computers & Industrial Engineering 48, 39–54 (2005)
Ali, H.: League Championship Algorithm: A New Algorithm for Numerical Function Optimization. In: International Conference of Soft Computing and Pattern Recognition, pp. 43-48 (2009)
Abdul, R., Potts, T.S.: Dynamic Programming State-space Relaxation for Single-machine Scheduling. Journal of the Operational Research Society 39, 141–152 (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pourali, Z., Aminnayeri, M. (2011). A Novel Discrete League Championship Algorithm for Minimizing Earliness/Tardiness Penalties with Distinct Due Dates and Batch Delivery Consideration. In: Huang, DS., Gan, Y., Bevilacqua, V., Figueroa, J.C. (eds) Advanced Intelligent Computing. ICIC 2011. Lecture Notes in Computer Science, vol 6838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24728-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-24728-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24727-9
Online ISBN: 978-3-642-24728-6
eBook Packages: Computer ScienceComputer Science (R0)