A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
type: Item
instance of: scholarly article
title: A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
zbMATH Open document ID: 0909.90185
DOI: 10.1080/00207549508930220
author: Seyed Hessameddin Zegordi
author: Kenji Itoh
author: Takao Enkawa
published in: International Journal of Production Research
publication date: 1998-12-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1179684
zbMATH Keywords: simulated annealing
zbMATH Keywords: flow shop scheduling
zbMATH Keywords: early/tardy costs
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/00207549508930220
OpenAlex ID: W2065482755
cites work: Minimizing mean absolute deviation of completion times about a common due date
cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems
cites work: An improved annealing scheme for the QAP
cites work: Using simulated annealing to solve routing and location problems
cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
cites work: Focused Scheduling in Proportionate Flowshops
cites work: The Single Machine Early/Tardy Problem
cites work: Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
cites work: A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
cites work: SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS
description: scientific article; zbMATH DE number 1179684