Single-machine group scheduling with a time-dependent learning effect
Computers and Operations Research
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
Information Sciences: an International Journal
A new approach to the learning effect: Beyond the learning curve restrictions
Computers and Operations Research
A novel hybrid immune algorithm for global optimization in design and manufacturing
Robotics and Computer-Integrated Manufacturing
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
Applied Soft Computing
Some scheduling problems with general position-dependent and time-dependent learning effects
Information Sciences: an International Journal
Structural inverse analysis by hybrid simplex artificial bee colony algorithms
Computers and Structures
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
Information Sciences: an International Journal
Experience-based approach to scheduling problems with the learning effect
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Single-machine group scheduling problems under the effects of deterioration and learning
Computers and Industrial Engineering
Minimizing the makespan on a single machine with learning and unequal release times
Computers and Industrial Engineering
Single machine multiple common due dates scheduling with learning effects
Computers & Mathematics with Applications
A note on the learning effect in multi-agent optimization
Expert Systems with Applications: An International Journal
Information Sciences: an International Journal
Computers and Industrial Engineering
Using bees to solve a data-mining problem expressed as a max-sat one
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
A revision of machine scheduling problems with a general learning effect
Mathematical and Computer Modelling: An International Journal
A decomposition algorithm for the single machine total tardiness problem
Operations Research Letters
On decomposition of the total tardiness problem
Operations Research Letters
Artificial bee colony programming for symbolic regression
Information Sciences: an International Journal
A comparative study of population-based optimization algorithms for turning operations
Information Sciences: an International Journal
Optimization of cutting parameters in multi-pass turning using artificial bee colony-based approach
Information Sciences: an International Journal
Comparison of evolutionary-based optimization algorithms for structural design optimization
Engineering Applications of Artificial Intelligence
An artificial bee colony algorithm for the maximally diverse grouping problem
Information Sciences: an International Journal
A new hybrid artificial bee colony algorithm for robust optimal design and manufacturing
Applied Soft Computing
Block matching algorithm for motion estimation based on Artificial Bee Colony (ABC)
Applied Soft Computing
| Hi-index | 0.07 |
This study considers an NP-hard problem of minimizing the total tardiness on a single machine with arbitrary release dates and position-dependent learning effects. A mixed-integer programming (MIP ) model is first formulated to find the optimal solution for small-size problem instances. Some new dominance rules are then presented which provide a sufficient condition for finding local optimality. The branch-and-bound (B& B) strategy incorporating with several dominance properties and a lower bound is proposed to derive the optimal solution for medium- to-large-size problem instances, and four marriage-in-honey-bees optimization algorithms (MBO) are developed to derive near-optimal solutions for the problem. To show the effectiveness of the proposed algorithms, 3600 situations with 20 and 25 jobs, are randomly generated for experiments.