Abstract
This paper considers the earliness and tardiness problem of sequencing a set of independent jobs on non-identical multi-machines, and explores the use of artificial neural networks as a valid alternative to the traditional scheduling approaches. A coupled gradient network approach is employed to provide a shop scheduling analysis framework. The methodology is based on a penalty function approach used to construct the appropriate energy function and a gradient type network. The mathematical formulation of the problem is firstly presented and six coupled gradient networks are constructed to model the mixed nature of the problem. After the network architecture and the energy function were specified, the dynamics are defined by steepest gradient descent algorithm.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahmed, M.U., Sundararaghavan, P.S.: Minimizing the weighted sum of late and early completion penalties in a single machine. IIE Transactions 22, 288–290 (1990)
Rachavachari, M.: Scheduling problems with non-regular penalty functions - a review. Opsearch 25, 144–164 (1988)
Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: a review. Operations Research 38, 22–36 (1990)
Arkin, E., Roundy, R.O.: Weighted-tardiness scheduling on parallel machines with proportional weights. Operations Research 39, 64–81 (1991)
De, P., Ghosh, J.B., Wells, C.E.: Due dates and early/tardy scheduling on identical parallel machines. Naval Research Logistics 41, 17–32 (1994)
Sundararaghavan, P., Ahmed, M.U.: Minimizing the sum of absolute lateness in single-machine and multimachine scheduling. Naval Research Logistics Quarterly 31, 25–33 (1984)
Zhu, Z., Heady, R.: Minimizing the Sum of Job Earliness and Tardiness in a Multimachine System. International Journal of Production Research 36, 1619–1632 (1998)
Sivrikaya-Serifoglu, F., Ulusoy, G.: Parallel machine scheduling with earliness and tardiness penalties. Computers & Operations Research 26, 773–787 (1999)
Balakrishan, N., Kanet, J.J., Sridharan, S.V.: Early/tardy scheduling with sequence dependent setups on uniform parallel machines. Computers & Operations Research 26, 127–141 (1999)
Radhakrishnan, S., Ventura, J.A.: Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence dependent setup times. International Journal of Operational Research 8, 2233–2252 (2000)
Croce, F.D., Trubian, M.: Optimal idle time insertion in early-tardy parallel machines scheduling with precedence constraints. Production Planning & Control 13, 133–142 (2002)
Mendes, A.S., Mller, F.M., Frana, P.M., Moscato, P.: Comparing meta-heuristic approaches for parallel machine scheduling problems. Production Planning & Control 13, 143–154 (2002)
Sun, H., Wang, G.: Parallel machine earliness and tardiness scheduling with proportional weights. Computers & Operations Research 30, 801–808 (2003)
Zhu, Z., Heady, R.B.: Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming appraoch. Computers & Industrial Engineering 38, 297–305 (2000)
Hopfield, J.: Neurons with graded response have collective computational properties like those of two-state neurons. Proceedings of the National Academy of Sciences of the USA 81, 3088–3092 (1984)
Hopfield, J., Tank, T.W.: Neural computation of decisions in optimization problems. Biological Cybernetics 52, 141–152 (1985)
Watta, P.B.: A coupled gradient network approach for static and temporal mixed-integer optimization. IEEE Transactions on Neural Networks 7, 578–593 (1996)
Smith, K.: Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research. Informs Journal on Computing 11, 15–34 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akyol, D.E., Bayhan, G.M. (2005). A Coupled Gradient Network Approach for the Multi Machine Earliness and Tardiness Scheduling Problem. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_63
Download citation
DOI: https://doi.org/10.1007/11424925_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25863-6
Online ISBN: 978-3-540-32309-9
eBook Packages: Computer ScienceComputer Science (R0)