An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
type: Item
instance of: scholarly article
title: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
zbMATH Open document ID: 0922.90089
DOI: 10.1016/S0377-2217(96)00273-1
author: Chandrasekharan Rajendran
author: Hans Ziegler
published in: European Journal of Operational Research
publication date: 1999-03-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1260417
zbMATH Keywords: flowshop
zbMATH Keywords: total weighted flowtime of jobs
zbMATH Keywords: heuristic
zbMATH Keywords: lower bounds
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: An Evaluation of Flow Shop Sequencing Heuristics
cites work: Q3938812
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: A user's guide to tabu search
cites work: Flowshop sequencing with mean flowtime objective
cites work: Modified simulated annealing algorithms for the flow shop sequencing 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: ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
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: A new heuristic method for the flow shop sequencing problem
description: scientific article; zbMATH DE number 1260417