Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
From MaRDI portal
Publication:2664314
DOI10.1016/j.cor.2020.104943zbMath1458.90261OpenAlexW3031737217MaRDI QIDQ2664314
Radhwane Boufellouh, Fayçal Belkaid
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.104943
production schedulingpreventive maintenance (PM)bi-objective particle swarm optimization (BOPSO)bi-objective randomized local search (BORLS)nondominated sorting genetic algorithm (NSGA-II)resource supply
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
\(N\)-NEH+ algorithm for solving permutation flow shop problems, Joint optimization of production scheduling and group preventive maintenance planning in multi-machine systems, Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity
Uses Software
Cites Work
- Unnamed Item
- Approximability of scheduling problems with resource consuming jobs
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
- A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Hybrid flowshop scheduling with machine and resource-dependent processing times
- An integrated cost model for production scheduling and perfect maintenance
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Considering scheduling and preventive maintenance in the flowshop sequencing problem
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines
- Approximation results for flow shop scheduling problems with machine availability constraints
- An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
- Flow shops with machine maintenance: ordered and proportionate cases
- Scheduling subject to nonrenewable-resource constraints
- Optimal minimal-repair and replacement problem with age dependent cost structure
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
- Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Scheduling with limited machine availability
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures
- Two-machine flow shop scheduling integrated with preventive maintenance planning
- Optimal two- and three-stage production schedules with setup times included
- Basic scheduling problems with raw material constraints
- Scheduling under a Non-renewable Resource Constraint
- Flow Shop Scheduling with Resource Flexibility
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
