Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation

DOI10.1016/j.cor.2013.11.017zbMath1348.90242OpenAlexW2030086529MaRDI QIDQ337206

J. Behnamian

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.11.017

zbMATH Keywords

variable neighborhood searchPareto solutionsdistributed schedulingbenders decomposition\(\epsilon\)-constraint approachtransportation timevirtual corporation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping, A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method, Accelerating Benders decomposition: multiple cuts via multiple solutions, A hyper-heuristic for distributed parallel machine scheduling with machine-dependent processing and sequence-dependent setup times, A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities, The Benders decomposition algorithm: a literature review, Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion, Matheuristic for the decentralized factories scheduling problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• The distributed permutation flowshop scheduling problem
• A tabu search approach for the flow shop scheduling problem
• Nonlinear multiobjective optimization
• Variable neighborhood search
• Optimal planning in large multi-site production networks
• Multi-plant production planning in capacitated self-configuring two-stage serial systems
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
• Principles of Sequencing and Scheduling
• Scheduling Problems with Two Competing Agents
• Heuristic Techniques for Simultaneous Scheduling of Production and Distribution in Multi-Echelon Structures: Theory and Empirical Comparisons
• Scheduling