A simulated multi-objective model for flexible job shop transportation scheduling
From MaRDI portal
Publication:2150761
DOI10.1007/s10479-020-03600-0zbMath1490.90141OpenAlexW3016288093MaRDI QIDQ2150761
Yiyi Xu, M'hammed Sahnoun, Fouad Ben Abdelaziz, David Baudry
Publication date: 30 June 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03600-0
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- A Mathematical Theory of Communication
- An integrated search heuristic for large-scale flexible job shop scheduling problems
- A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms
- Tabu search algorithms for job-shop problems with a single transport robot
- Optimal production scheduling for the dairy industry
- Multiobjective optimization. Interactive and evolutionary approaches
- Preemptive scheduling in the presence of transportation times
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- Job-shop scheduling with multi-purpose machines
- Lexicographic optimality in the multiple objective linear programming: The nucleolar solution
- 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 genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- NP-hardness of shop-scheduling problems with three jobs
- Effective neighbourhood functions for the flexible job shop problem
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
- Routing and scheduling in a flexible job shop by tabu search
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A genetic algorithm for the flexible job-shop scheduling problem
- Optimal Estimation of Executive Compensation by Linear Programming
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
This page was built for publication: A simulated multi-objective model for flexible job shop transportation scheduling
