Routing and scheduling in a flexible job shop by tabu search
Annals of Operations Research - Special issue on Tabu search
New Single Machine and Job-Shop Scheduling Problems with Availability Constraints
Journal of Scheduling
Computers in Industry - Special issue: Application of genetics algorithms in industry
Computers and Industrial Engineering
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Computers and Industrial Engineering
Optimal parallel machines scheduling with availability constraints
Discrete Applied Mathematics
Computers and Operations Research
Considering scheduling and preventive maintenance in the flowshop sequencing problem
Computers and Operations Research
A two-machine flowshop scheduling problem with a separated maintenance constraint
Computers and Operations Research
Computers and Operations Research
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Computers and Operations Research
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints
Computers and Industrial Engineering
A survey of scheduling with deterministic machine availability constraints
Computers and Industrial Engineering
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Computers and Industrial Engineering
Hi-index | 0.00 |
Most production scheduling problems, including the standard flexible job-shop scheduling problem (FJSP), assume that machines are continuously available. However, in most realistic situations, machines may become unavailable during certain periods due to preventive maintenance (PM). In this paper, a flexible job-shop scheduling problem with machine availability constraints is considered. Each machine is subject to preventive maintenance during the planning period and the starting times of maintenance activities are either flexible in a time window or fixed beforehand. Moreover, two cases of maintenance resource constraint are considered: sufficient maintenance resource available or only one maintenance resource available. To deal with this variant FJSP problem with maintenance activities, a filtered beam search (FBS) based heuristic algorithm is proposed. With a modified branching scheme, the machine availability constraint and maintenance resource constraint can be easily incorporated into the proposed algorithm. Simulation experiments are conducted on some representative problems. The results demonstrate that the proposed filtered beam search based heuristic algorithm is a viable and effective approach for the FJSP with maintenance activities.