Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm

DOI10.1016/j.apm.2016.09.022zbMath1443.90039OpenAlexW2529659779WikidataQ56611819 ScholiaQ56611819MaRDI QIDQ2284476

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

zbMATH Keywords

schedulingmathematical modelsflexible job shopstransportation timeshybrid imperialist competitive algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)

Related Items (11)

A simulated multi-objective model for flexible job shop transportation scheduling ⋮ A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times ⋮ Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters ⋮ A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time ⋮ Shop scheduling in manufacturing environments: a review ⋮ A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation ⋮ Flexible job-shop scheduling with transportation resources ⋮ An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints ⋮ Flexible job shop scheduling problem for parallel batch processing machine with compatible job families ⋮ An estimation of distribution algorithm for scheduling problem of flexible manufacturing systems using Petri nets ⋮ An uncertain programming model for single machine scheduling problem with batch delivery

Cites Work

• Unnamed Item
• Unnamed Item
• Tabu search algorithms for job-shop problems with a single transport robot
• An effective architecture for learning and evolving flexible job-shop schedules
• Flexible job shop scheduling with overlapping in operations
• Mathematical models for job-shop scheduling problems with routing and process plan flexibility
• Preemptive scheduling in the presence of transportation times
• Job-shop scheduling with multi-purpose machines
• A heuristic for the two-machine open-shop scheduling problem with transportation times
• Effective neighbourhood functions for the flexible job shop problem
• Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques
• 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
• A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
• The Complexity of Flowshop and Jobshop Scheduling

This page was built for publication: Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm