Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises

DOI10.1007/S10479-014-1770-8zbMath1318.90030DBLPjournals/anor/HosseinabadiSSS15OpenAlexW1977453252WikidataQ57830806 ScholiaQ57830806MaRDI QIDQ492824

Shahaboddin Shamshirband, Mohammad Shojafar, Hajar Siar, Ali Asghar Rahmani Hosseinabadi, Mohd Hairul Nizam Md. Nasir

Publication date: 21 August 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1770-8

zbMATH Keywords

schedulingmakespanNewton's lawflexible job-shopGELS algorithmsmall medium enterprises

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Multipopulation genetic algorithms with different interaction structures to solve flexible job-shop scheduling problems: a network science perspective ⋮ OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises ⋮ A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico ⋮ Hybrid flow shop with unrelated machines, setup time, and work in progress buffers for bi-objective optimization of tortilla manufacturing ⋮ A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ Combining prospect theory with fuzzy theory to handle disruption in production scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient meta-heuristic algorithm for grid computing
• Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time
• A heuristic for scheduling general job shops to minimize maximum lateness
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• The flow shop with parallel machines: A tabu search approach
• Scheduling jobs on a \(k\)-stage flexible flow-shop
• Routing and scheduling in a flexible job shop by tabu search
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
• Flexible flow shop scheduling with uniform parallel machines
• A note on weighted completion time minimization in a flexible flow shop

This page was built for publication: Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises