Minimizing total tardiness on one machine is NP-hard
Mathematics of Operations Research
Selecting jobs for a heavily loaded shop with lateness penalties
Computers and Operations Research
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation
Computers and Industrial Engineering
Job selection in a heavily loaded shop
Computers and Operations Research
Sequencing parallel machining operations by genetic algorithms
Computers and Industrial Engineering - Special issue on computational intelligence for industrial engineering
Computers and Industrial Engineering - Special issue on computational intelligence for industrial engineering
Computers and Industrial Engineering
Computers and Industrial Engineering
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Multi-period job selection: planning work loads to maximize profit
Computers and Operations Research
A hybrid genetic algorithm for the job shop scheduling problems
Computers and Industrial Engineering
An evolutionary algorithm approach to the share of choices problem in the product line design
Computers and Operations Research
Flow-shop scheduling for three serial stations with the last two duplicate
Computers and Operations Research
Computers and Industrial Engineering - Special issue: Group technology/cellular manufacturing
Computers and Industrial Engineering - Special issue: Selected papers from the 31st international conference on computers & industrial engineering
A continuous approach to considering uncertainty in facility design
Computers and Operations Research
Order acceptance with weighted tardiness
Computers and Operations Research
Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
Computers and Operations Research
Genetic algorithms to solve the cover printing problem
Computers and Operations Research
Computers and Operations Research
Defining defects, errors, and service degradations
ACM SIGSOFT Software Engineering Notes
Computers and Operations Research
Computers and Operations Research
Recursive structure element decomposition using migration fitness scaling genetic algorithm
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
A tabu search algorithm for order acceptance and scheduling
Computers and Operations Research
A survey on offline scheduling with rejection
Journal of Scheduling
EuroGP'13 Proceedings of the 16th European conference on Genetic Programming
Hi-index | 0.01 |
This paper uses a genetic algorithm to solve the order-acceptance problem with tardiness penalties. We compare the performance of a myopic heuristic and a genetic algorithm, both of which do job acceptance and sequencing, using an upper bound based on an assignment relaxation. We conduct a pilot study, in which we determine the best settings for diversity operators (clone removal, mutation, immigration, population size) in connection with different types of local search. Using a probabilistic local search provides results that are almost as good as exhaustive local search, with much shorter processing times. Our main computational study shows that the genetic algorithm always dominates the myopic heuristic in terms of objective function, at the cost of increased processing time. We expect that our results will provide insights for the future application of genetic algorithms to scheduling problems. Scope and purpose: The importance of the order-acceptance decision has gained increasing attention over the past decade. This decision is complicated by the trade-off between the benefits of the revenue associated with an order, on one hand, and the costs of capacity, as well as potential tardiness penalties, on the other. In this paper, we use a genetic algorithm to solve the problem of which orders to choose to maximize profit, when there is limited capacity and an order delivered after its due date incurs a tardiness penalty. The genetic algorithm improves upon the performance of previous methods for large problems.