Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
DOI10.1016/J.APM.2016.09.022zbMATH Open1443.90039OpenAlexW2529659779WikidataQ56611819 ScholiaQ56611819MaRDI QIDQ2284476FDOQ2284476
Authors: Yanyan Li 
Publication date: 15 January 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2016.09.022
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
schedulingmathematical modelsflexible job shopstransportation timeshybrid imperialist competitive algorithm
Deterministic scheduling theory in operations research (90B35) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)
Cites Work
- Title not available (Why is that?)
- The Complexity of Flowshop and Jobshop Scheduling
- Effective neighbourhood functions for the flexible job shop problem
- Routing and scheduling in a flexible job shop by tabu search
- Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
- An effective architecture for learning and evolving flexible job-shop schedules
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- Preemptive scheduling in the presence of transportation times
- Job-shop scheduling with multi-purpose machines
- Flexible job shop scheduling with overlapping in operations
- Tabu search algorithms for job-shop problems with a single transport robot
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Title not available (Why is that?)
Cited In (12)
- 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
- 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
- An estimation of distribution algorithm for scheduling problem of flexible manufacturing systems using Petri nets
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)
