Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
From MaRDI portal
Publication:2284476
Recommendations
- A simulated multi-objective model for flexible job shop transportation scheduling
- Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm
- scientific article; zbMATH DE number 4108473
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- Flow shop scheduling problems with transportation constraints revisited
- Evaluation of mathematical models for flexible job-shop scheduling problems
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 5366553 (Why is no real title available?)
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- An effective architecture for learning and evolving flexible job-shop schedules
- Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques
- Effective neighbourhood functions for the flexible job shop problem
- Flexible job shop scheduling with overlapping in operations
- Job-shop scheduling with multi-purpose machines
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
- Preemptive scheduling in the presence of transportation times
- Routing and scheduling in a flexible job shop by tabu search
- Tabu search algorithms for job-shop problems with a single transport robot
- The Complexity of Flowshop and Jobshop Scheduling
Cited in
(16)- Flexible job shop scheduling problem for parallel batch processing machine with compatible job families
- A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time
- Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots
- An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
- Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm
- Minimizing total travel time in the flexible job-shop scheduling problem with transportation resources
- A simulated multi-objective model for flexible job shop transportation scheduling
- A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times
- Flexible job-shop scheduling with transportation resources
- Shop scheduling in manufacturing environments: a review
- An uncertain programming model for single machine scheduling problem with batch delivery
- Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters
- Matheuristic for the decentralized factories scheduling problem
- An estimation of distribution algorithm for scheduling problem of flexible manufacturing systems using Petri nets
- A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources
This page was built for publication: Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284476)
