A knowledge-based approach for multi-factory production systems
DOI10.1016/j.cor.2016.07.003zbMath1391.90220OpenAlexW2475111791MaRDI QIDQ1652022
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.003
mixed-integer programmingbatch deliveryimperialist competitive algorithmknowledge-based approachmulti-factory production systems
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (1)
Cites Work
- Unnamed Item
- A high performing metaheuristic for multi-objective flowshop scheduling problem
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- Single-machine batch scheduling minimizing weighted flow times and delivery costs
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
- The distributed permutation flowshop scheduling problem
- Learnable evolution model: Evolutionary processes guided by machine learning
- Multi-site scheduling with fuzzy concepts
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- Minimizing maximum tardiness and delivery costs with batch delivery and job release times
- A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine
- Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
- Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop
- Scheduling job shop problems with sequence-dependent setup times
- An introduction of dominant genes in genetic algorithm for FMS
This page was built for publication: A knowledge-based approach for multi-factory production systems
