Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
From MaRDI portal
Publication:356114
DOI10.1016/j.camwa.2012.04.007zbMath1268.90018OpenAlexW2037597869MaRDI QIDQ356114
Ghorbanali Mohammadi, Vahid Majazi Dalfard
Publication date: 25 July 2013
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2012.04.007
Multi-objective and goal programming (90C29) Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)
Related Items (9)
Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach ⋮ Bi-objective parallel machine scheduling with additional resources during setups ⋮ Solving multi-objective parallel machine scheduling problem by a modified NSGA-II ⋮ Extension of an algorithm for product mix problems with fuzzy conditions ⋮ Enhanced simulated annealing for solving aggregate production planning ⋮ A research survey: review of flexible job shop scheduling techniques ⋮ Production, maintenance and resource scheduling: a review
Uses Software
Cites Work
- Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
- Single machine multiple common due dates scheduling with learning effects
- Some single-machine scheduling problems with general effects of learning and deterioration
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- Improved hybrid simulated annealing algorithm for navigation scheduling for the two dams of the Three Gorges Project
- Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences
- Single machine scheduling with decreasing linear deterioration under precedence constraints
- Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
- Scheduling a maintenance activity to minimize total weighted completion-time
- Minimizing the maximum deviation of job completion time about a common due-date
- Single machine flow-time scheduling with a single breakdown
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- The disjunctive graph machine representation of the job shop scheduling problem
- Scheduling with limited machine availability
- Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
- Single-machine scheduling with general learning functions
- Two-machine flow shop no-wait scheduling with machine maintenance
- Scheduling on semi-identical processors
- A Review of Production Scheduling
This page was built for publication: Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
