Flexible job-shop scheduling problem under resource constraints
From MaRDI portal
Publication:5478847
DOI10.1080/00207540500386012zbMath1095.90035OpenAlexW2171019073MaRDI QIDQ5478847
No author found.
Publication date: 13 July 2006
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540500386012
Genetic algorithmsSequencingResource constraintsFlexible job-shop schedulingOperations-machines assignment
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (12)
Genetic algorithms in supply chain management: a critical analysis of the literature ⋮ A variable neighbourhood search algorithm for the flexible job-shop scheduling problem ⋮ A genetic algorithm for flexible job shop scheduling with fuzzy processing time ⋮ A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department ⋮ Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ Solving the flexible job shop scheduling problem with sequence-dependent setup times ⋮ Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times ⋮ A MILP model for an extended version of the flexible job shop problem ⋮ Mathematical models for job-shop scheduling problems with routing and process plan flexibility ⋮ A research survey: review of flexible job shop scheduling techniques ⋮ A Taxonomy for the Flexible Job Shop Scheduling Problem ⋮ Personnel scheduling and supplies provisioning in emergency relief operations
Cites Work
- Job-shop scheduling with multi-purpose machines
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- Effective neighbourhood functions for the flexible job shop problem
- Routing and scheduling in a flexible job shop by tabu search
- A genetic algorithm methodology for complex scheduling problems
- Dynamic scheduling of FMS using a real-time genetic algorithm
- Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
- A self-adapting genetic algorithm for project scheduling under resource constraints
- A genetic algorithm-based approach to machine assignment problem
This page was built for publication: Flexible job-shop scheduling problem under resource constraints
