Hybrid flowshop scheduling with machine and resource-dependent processing times
type: Item
instance of: scholarly article
title: Hybrid flowshop scheduling with machine and resource-dependent processing times
zbMATH Open document ID: 1211.90077
author: J. Behnamian
author: S. M. T. Fatemi Ghomi
published in: Applied Mathematical Modelling
publication date: 2011-05-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5886526
zbMATH Keywords: hybrid flowshop scheduling
zbMATH Keywords: hybrid metaheuristic
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: resource allocation
zbMATH Keywords: machines with different speeds
zbMATH Keywords: sequence-dependent setup times
describes a project that uses: Genocop
MaRDI profile type: Publication
full work available at URL: j.apm.2010.07.057
OpenAlex ID: W2016921772
cites work: A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines
cites work: A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
cites work: Q5187227
cites work: Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
cites work: A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
cites work: On min-norm and min-max methods of multi-objective optimization
cites work: Q3832072
cites work: Q4817401
cites work: Q4422139
cites work: A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
cites work: Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
cites work: A flexible flowshop problem with total flow time minimization
cites work: Heuristics for hybrid flow shops with controllable processing times and assignable due dates
cites work: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
cites work: Group technology in a hybrid flowshop environment: a case study
cites work: A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
cites work: An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
cites work: An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks
cites work: Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
cites work: A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
cites work: Heuristic for a new multiobjective scheduling problem
cites work: Nonlinear multiobjective optimization
cites work: Q3815146
cites work: Q4079017
cites work: Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
cites work: Q4873721
cites work: Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
DOI: 10.1016/J.APM.2010.07.057
description: scientific article; zbMATH DE number 5886526