Flowshop sequencing with mean flowtime objective
type: Item
instance of: scholarly article
title: Flowshop sequencing with mean flowtime objective
zbMATH Open document ID: 0912.90173
DOI: 10.1016/0377-2217(93)E0353-Y
author: Johnny C. Ho
published in: European Journal of Operational Research
publication date: 1998-08-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1191373
zbMATH Keywords: near-optimal heuristic
zbMATH Keywords: total or mean flowtime
zbMATH Keywords: \(n\)-job, \(M\)-machine flowshop
zbMATH Keywords: simulation
MaRDI profile type: Publication
cites work: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
cites work: Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: An Evaluation of Flow Shop Sequencing Heuristics
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: A new heuristic for the n-job, M-machine flow-shop problem
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
cites work: An efficient heuristic approach to the scheduling of jobs in a flowshop
cites work: On general routing problems
cites work: A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop
full work available at URL: 0377-2217(93)e0353-y
OpenAlex ID: W2040815373
description: scientific article; zbMATH DE number 1191373