Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
type: Item
instance of: scholarly article
title: Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
zbMATH Open document ID: 1254.90066
author: Maedeh Bank
author: S. M. T. Fatemi Ghomi
author: Fariborz Jolai
author: J. Behnamian
published in: Applied Mathematical Modelling
publication date: 2013-01-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6124864
zbMATH Keywords: flow shop
zbMATH Keywords: scheduling
zbMATH Keywords: deteriorating job
zbMATH Keywords: branch and bound algorithm
zbMATH Keywords: heuristic algorithm
MaRDI profile type: Publication
full work available at URL: j.apm.2011.12.010
OpenAlex ID: W2020707914
cites work: Scheduling with time dependent processing times: Review and extensions
cites work: A concise survey of scheduling with time-dependent processing times
cites work: Multi-Machine Scheduling With Linear Deterioration
cites work: NP-hard cases in scheduling deteriorating jobs on dedicated machines
cites work: Q5047629
cites work: Flow shop scheduling problems with deteriorating jobs under dominating machines
cites work: Minimizing total completion time in a two-machine flow shop with deteriorating jobs
cites work: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
cites work: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
cites work: SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
cites work: A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
cites work: Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
cites work: Single-machine total completion time scheduling with a time-dependent deterioration
cites work: Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
cites work: Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
cites work: Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
cites work: Single-machine due-window assignment problem with learning effect and deteriorating jobs
cites work: A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
cites work: Q5485395
cites work: Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Minimizing tardiness in a two-machine flow-shop
cites work: A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
DOI: 10.1016/J.APM.2011.12.010
description: scientific article; zbMATH DE number 6124864