A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times

DOI10.1016/j.amc.2015.03.059zbMath1410.90081OpenAlexW2075112045MaRDI QIDQ1643055

Tamer F. Abdelmaguid

Publication date: 18 June 2018

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://repositorio.unal.edu.co/handle/unal/79474

zbMATH Keywords

tabu searchneighborhood searchflexible job shop schedulingsequence-dependent setup timealgorithm design

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times ⋮ Solving the flexible job shop scheduling problem with sequence-dependent setup times ⋮ 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

Cites Work

• Permutation-induced acyclic networks for the job shop scheduling problem
• Discrepancy search for the flexible job shop scheduling problem
• 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
• Lower bounds for the job-shop scheduling problem on multi-purpose machines
• Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
• Effective neighbourhood functions for the flexible job shop problem
• Routing and scheduling in a flexible job shop by tabu search
• A survey of scheduling problems with setup times or costs
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
• A genetic algorithm for the flexible job-shop scheduling problem
• Job shop scheduling with alternative machines
• A loading and dispatching problem in a random flexible manufacturing system
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Algorithms for Solving Production-Scheduling Problems

This page was built for publication: A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times