A two-machine flowshop scheduling problem with precedence constraint on two jobs
type: Item
instance of: scholarly article
title: A two-machine flowshop scheduling problem with precedence constraint on two jobs
zbMATH Open document ID: 1381.90037
author: Shuenn-Ren Cheng
author: Yunqiang Yin
author: C. H. Wen
author: Win-Chin Lin
author: Chin-Chia Wu
author: Jun Liu
published in: Soft Computing
publication date: 2018-02-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6843954
zbMATH Keywords: scheduling
zbMATH Keywords: two-machine flowshop
zbMATH Keywords: total tardiness
zbMATH Keywords: precedent constraint
MaRDI profile type: Publication
full work available at URL: s00500-015-1908-x
OpenAlex ID: W2197175153
cites work: Tabu search for total tardiness minimization in flowshop scheduling problems
cites work: Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
cites work: A dual algorithm for the one-machine scheduling problem
cites work: Two-machine flowshop scheduling to minimize total tardiness
cites work: A Survey of Scheduling Rules
cites work: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
cites work: Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
DOI: 10.1007/S00500-015-1908-X
description: scientific article; zbMATH DE number 6843954