A knowledge-based approach for multi-factory production systems
type: Item
instance of: scholarly article
title: A knowledge-based approach for multi-factory production systems
zbMATH Open document ID: 1391.90220
author: Y. Aharonov
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6901263
zbMATH Keywords: multi-factory production systems
zbMATH Keywords: batch delivery
zbMATH Keywords: mixed-integer programming
zbMATH Keywords: knowledge-based approach
zbMATH Keywords: imperialist competitive algorithm
MaRDI profile type: Publication
full work available at URL: j.cor.2016.07.003
OpenAlex ID: W2475111791
cites work: Multi-site scheduling with fuzzy concepts
cites work: An introduction of dominant genes in genetic algorithm for FMS
cites work: The distributed permutation flowshop scheduling problem
cites work: The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine
cites work: Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
cites work: Q4284154
cites work: Single-machine batch scheduling minimizing weighted flow times and delivery costs
cites work: A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
cites work: A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
cites work: A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
cites work: Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
cites work: Minimizing maximum tardiness and delivery costs with batch delivery and job release times
cites work: Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
cites work: A high performing metaheuristic for multi-objective flowshop scheduling problem
cites work: Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop
cites work: Learnable evolution model: Evolutionary processes guided by machine learning
cites work: Scheduling job shop problems with sequence-dependent setup times
cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
DOI: 10.1016/J.COR.2016.07.003
description: scientific article; zbMATH DE number 6901263