Hybrid Genetic Bees Algorithm applied to single machine scheduling with earliness and tardiness penalties
暂无分享,去创建一个
Duc Truong Pham | Alfredo Lambiase | Marcello Fera | Michael S. Packianather | Fabio Fruggiero | Baris Yuce | Ernesto Mastrocinque | D. Pham | M. Packianather | A. Lambiase | F. Fruggiero | M. Fera | E. Mastrocinque | B. Yuce
[1] T. C. Edwin Cheng,et al. Single-machine scheduling with a common due window , 2001, Comput. Oper. Res..
[2] Averill M. Law,et al. Simulation Modeling and Analysis , 1982 .
[3] S. T. Webster,et al. The complexity of scheduling job families about a common due date , 1997, Oper. Res. Lett..
[4] T. Seeley. The Wisdom of the Hive: The Social Physiology of Honey Bee Colonies , 1995 .
[5] Chris N. Potts,et al. Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time , 1997, Ann. Oper. Res..
[6] Grosan Crina,et al. Stigmergic Optimization: Inspiration, Technologies and Perspectives , 2006 .
[7] Alfredo Lambiase,et al. A multi-objective supply chain optimisation using enhanced Bees Algorithm with adaptive neighbourhood search and site abandonment strategy , 2014, Swarm Evol. Comput..
[8] Martin Feldmann,et al. Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches , 2003 .
[9] Jeffrey E. Schaller,et al. Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem , 2012, Comput. Oper. Res..
[10] H. G. Kahlbacher,et al. A proof for the longest‐job‐first policy in one‐machine scheduling , 1991 .
[11] Débora P. Ronconi,et al. Minimizing earliness and tardiness penalties in a single-machine problem with a common due date , 2005, Eur. J. Oper. Res..
[12] T. S. Abdul-Razaq,et al. Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .
[13] De-Li Yang,et al. Solving single machine scheduling under disruption with discounted costs by quantum-inspired hybrid heuristics , 2013 .
[14] Genichii Taguchi,et al. Introduction to quality engineering. designing quality into products a , 1986 .
[15] Hamilton Emmons,et al. One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..
[16] José Elias Claudio Arroyo,et al. Hybrid GRASP Heuristics to Solve an Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties , 2014, CLEI Selected Papers.
[17] S. S. Panwalkar,et al. Optimal assignment of due-dates for a single processor scheduling problem , 1981 .
[18] Frank Werner,et al. On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties , 2004, Comput. Oper. Res..
[19] ALOK SINGH,et al. A Hybrid Permutation-Coded Evolutionary Algorithm for the Early/tardy Scheduling Problem , 2010, Asia Pac. J. Oper. Res..
[20] Jerzy Kyparisis,et al. Single machine scheduling research , 1987 .
[21] Thomas E. Morton,et al. The single machine early/tardy problem , 1989 .
[22] Robert A. Gessner,et al. Master Production Schedule Planning , 1986 .
[23] F. Fruggiero,et al. Production Scheduling Approaches for Operations Management , 2013 .
[24] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[25] S. S. Panwalkar,et al. Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..
[26] Martin Feldmann,et al. Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates , 2001, Comput. Oper. Res..
[27] Sushil K. Gupta,et al. Minimizing a quadratic function of job lateness on a single machine , 1983 .
[28] Mitsuo Gen,et al. Genetic algorithms and engineering design , 1997 .
[29] Jorge M. S. Valente. Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time , 2008, Comput. Ind. Eng..
[30] Gur Mosheiov,et al. Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs , 2006, Eur. J. Oper. Res..
[31] Pablo Moscato,et al. A memetic algorithm for the total tardiness single machine scheduling problem , 2001, Eur. J. Oper. Res..
[32] George Z. Li. Single machine earliness and tardiness scheduling , 1997 .
[33] D. Pham,et al. Honey Bees Inspired Optimization Method: The Bees Algorithm , 2013, Insects.
[34] Xiao-Yuan Wang,et al. Single machine common flow allowance scheduling with a rate-modifying activity , 2010, Comput. Ind. Eng..
[35] Federico Della Croce,et al. A hybrid heuristic approach for single machine scheduling with release times , 2014, Comput. Oper. Res..
[36] D. Yang,et al. Scheduling problems with multiple due windows assignment and controllable processing times on a single machine , 2014 .
[37] J. J. Kanet. Minimizing the average deviation of job completion times about a common due date , 1981 .
[38] Pei-Chann Chang,et al. A heuristic to minimize a quadratic function of job lateness on a single machine , 1998 .
[39] Chung-Yee Lee,et al. Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date , 1991, Comput. Oper. Res..
[40] Roel Leus,et al. Meta-heuristics for stable scheduling on a single machine , 2008, Comput. Oper. Res..
[41] Adam Janiak,et al. Single machine scheduling problem with a common deadline and resource dependent release dates , 1991 .
[42] C. T. Ng,et al. Group scheduling and due date assignment on a single machine , 2011 .
[43] Ching-Fang Liaw,et al. A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem , 1999, Comput. Oper. Res..
[44] Gwo-Ji Sheen,et al. Single-machine scheduling with multiple performance measures: Minimizing job-dependent earliness and tardiness subject to the number of tardy jobs , 2007 .
[45] Shuo-Yan Chou,et al. A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date , 2007, Eur. J. Oper. Res..
[46] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..
[47] Jaegyun Kim,et al. A hybrid genetic approach for single machine scheduling with distinct due dates and release times , 1999, Proceedings Third Russian-Korean International Symposium on Science and Technology. KORUS'99 (Cat. No.99EX362).
[48] Alfredo Lambiase,et al. Performance parameters optimization of a pneumatic programmable palletizer using Taguchi method , 2003 .
[49] Yih-Long Chang,et al. MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .
[50] Andreas C. Nearchou,et al. An efficient meta-heuristic for the single machine common due date scheduling problem , 2006 .
[51] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[52] Lei Li,et al. Earliness-tardiness production planning for just-in-time manufacturing: A unifying approach by goal programming , 2006, Eur. J. Oper. Res..
[53] Mehmet Fatih Tasgetiren,et al. A Discrete Particle Swarm Optimization Algorithm for Single Machine Total Earliness and Tardiness Problem with a Common Due Date , 2006, 2006 IEEE International Conference on Evolutionary Computation.
[54] Shuo-Yan Chou,et al. Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date , 2007, J. Heuristics.
[55] Tapan Sen,et al. Minimizing a weighted quadratic function of job lateness in the single machine system , 1996 .
[56] D. Pham,et al. THE BEES ALGORITHM, A NOVEL TOOL FOR COMPLEX OPTIMISATION PROBLEMS , 2006 .
[57] John B. Kidd,et al. Toyota Production System , 1993 .
[58] K. Frisch. Bees: their vision, chemical senses, and language , 1950 .
[59] Marshall L. Fisher,et al. An Algorithm for the Space-Shuttle Scheduling Problem , 1978, Oper. Res..
[60] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[61] Alok Singh,et al. A swarm intelligence approach to the early/tardy scheduling problem , 2012, Swarm Evol. Comput..
[62] Vitaly A. Strusevich,et al. Single machine scheduling and due date assignment with positionally dependent processing times , 2009, Eur. J. Oper. Res..
[63] Thimo Zahn,et al. Manufacturing Strategy – A Neglected Success Factor for Improving Competitiveness , 2016 .
[64] Chengbin Chu,et al. A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..
[65] Maria Teresa Almeida,et al. A composite heuristic for the single machine early/tardy job scheduling problem , 1998, Comput. Oper. Res..
[66] T. C. Edwin Cheng,et al. Optimal common due-date with limited completion time deviation , 1988, Comput. Oper. Res..
[67] Rym M'Hallah,et al. Minimizing total earliness and tardiness on a single machine using a hybrid heuristic , 2007, Comput. Oper. Res..
[68] Zhi-Long Chen,et al. Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs , 1996 .
[69] Andreas C. Nearchou,et al. A differential evolution approach for the common due date early/tardy job scheduling problem , 2008, Comput. Oper. Res..
[70] José Fernando Gonçalves,et al. A Hybrid Genetic Algorithm for the Early/tardy Scheduling Problem , 2006, Asia Pac. J. Oper. Res..
[71] T. C. E. Cheng,et al. Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine , 1984 .
[72] J. Carlier. The one-machine sequencing problem , 1982 .
[73] Jeffrey E. Schaller,et al. A comparison of lower bounds for the single-machine early/tardy problem , 2007, Comput. Oper. Res..
[74] J. L. Gould,et al. Honey bee recruitment: the dance-language controversy. , 1975, Science.
[75] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[76] Duc Truong Pham,et al. Neural network design and feature selection using principal component analysis and Taguchi method for identifying wood veneer defects , 2014 .
[77] Huang Ming,et al. An Improved Bee Algorithm-Genetic Algorithm , 2011 .
[78] T. C. Edwin Cheng,et al. Due-date assignment and single machine scheduling with deteriorating jobs , 2004, J. Oper. Res. Soc..
[79] G. Rand. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .
[80] Jorge M. S. Valente,et al. Improved heuristics for the early/tardy scheduling problem with no idle time , 2005, Comput. Oper. Res..
[81] R. T. Yanushevsky,et al. Optimal strategic planning problems in manufacturing based on the input-output models , 1992 .
[82] Fariborz Jolai,et al. Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs , 2007, Appl. Math. Comput..