Matchup scheduling with multiple resources, release dates and disruptions
Operations Research
One-machine rescheduling heuristics with efficiency and stability as criteria
Computers and Operations Research
Computers and Operations Research
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation
Computers and Industrial Engineering
Computers and Industrial Engineering
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Advanced planning and scheduling with outsourcing in manufacturing supply chain
Computers and Industrial Engineering - Supply chain management
Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods
Journal of Scheduling
Dynamic rescheduling that simultaneously considers efficiency and stability
Computers and Industrial Engineering
Operations Research
Production scheduling and rescheduling with genetic algorithms
Evolutionary Computation
MAS Equipped with Ant Colony Applied into Dynamic Job Shop Scheduling
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Optimizing patrol force deployment using a genetic algorithm
Expert Systems with Applications: An International Journal
An improved genetic algorithm for optimal feature subset selection from multi-character feature set
Expert Systems with Applications: An International Journal
Assembly line balancing in garment industry
Expert Systems with Applications: An International Journal
Hi-index | 12.06 |
This paper investigates a dynamic advanced planning and scheduling (DAPS) problem where new orders arrive on a continuous basis. A periodic policy with a frozen interval is adopted to increase stability on the shop floor. A genetic algorithm is developed to find a schedule such that both production idle time and penalties on tardiness and earliness of both original orders and new orders are minimized at each rescheduling point. The proposed methodology is tested on a series of examples. A representative example is illustrated to indicate that the suggested approach can improve the schedule stability while retaining efficiency.