Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
type: Item
instance of: scholarly article
title: Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
zbMATH Open document ID: 0912.90185
DOI: 10.1016/0377-2217(94)00021-4
author: Seyed Hessameddin Zegordi
author: Kenji Itoh
author: Takao Enkawa
published in: European Journal of Operational Research
publication date: 1998-11-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1189538
zbMATH Keywords: heuristics
zbMATH Keywords: simulated annealing
zbMATH Keywords: flow shop scheduling
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00021-4
OpenAlex ID: W1969513029
cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: Simulated Annealing – An Annotated Bibliography
cites work: An improved annealing scheme for the QAP
cites work: General Purpose Simulated Annealing
cites work: An Evaluation of Flow Shop Sequencing Heuristics
cites work: Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
cites work: Simulated annealing: A tool for operational research
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Using simulated annealing to solve routing and location problems
cites work: Flowshop and Jobshop Schedules: Complexity and Approximation
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Optimization by Simulated Annealing
cites work: Heuristic unidirectional flowpath design approaches for automated guided vehicle systems
cites work: Convergence of an annealing algorithm
cites work: Equation of State Calculations by Fast Computing Machines
cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: On the heuristic solution of the permutation flow shop problem by path algorithms
cites work: Applying Stochastic Algorithms to a Locomotive Scheduling Problem
cites work: SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS
description: scientific article; zbMATH DE number 1189538