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

DOI10.1016/J.COR.2013.11.017MaRDI QIDQ337206zbMATH OpenOpenAlexFDO

Authors 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

Pareto solutionsvariable neighborhood searchdistributed scheduling\(\epsilon\)-constraint approachbenders decompositiontransportation timevirtual corporation

Mathematics Subject Classification ID

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

Recommendations

• Matheuristic for the decentralized factories scheduling problem
• Multi-objective multi-factory scheduling
• The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
• Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling

Cites work

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

Cited in

(9)

• 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
• A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method
• The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine
• Matheuristic for the decentralized factories scheduling problem
• Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping
• Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337206)