Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
type: Item
instance of: scholarly article
title: Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
zbMATH Open document ID: 1110.90036
author: Byung-Cheon Choi
author: Suk-Hun Yoon
author: Sung-Jin Chung
published in: European Journal of Operational Research
publication date: 2006-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5073098
zbMATH Keywords: scheduling
zbMATH Keywords: proportionate flow shop
zbMATH Keywords: NP-completeness
zbMATH Keywords: worst-case performance ratio
MaRDI profile type: Publication
full work available at URL: j.ejor.2005.09.030
OpenAlex ID: W2013982419
cites work: Q4198056
cites work: Flowshop and Jobshop Schedules: Complexity and Approximation
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Generating Experimental Data for Computational Testing with Machine Scheduling Applications
cites work: The three-machine proportionate flow shop problem with unequal machine speeds
cites work: Worst-case analysis of an approximation algorithm for flow-shop scheduling
cites work: New results in the worst-case analysis for flow-shop scheduling
cites work: Focused Scheduling in Proportionate Flowshops
cites work: Q3525911
cites work: Minimizing total weighted completion time in a proportionate flow shop
cites work: Flowshop Sequencing Problem with Ordered Processing Time Matrices
cites work: Flowshop sequencing problem with ordered processing time matrices: A general case
cites work: Some results of the worst-case analysis for flow shop scheduling
cites work: Short Shop Schedules
DOI: 10.1016/J.EJOR.2005.09.030
description: scientific article; zbMATH DE number 5073098