A note on makespan minimization in proportionate flow shops
type: Item
instance of: scholarly article
title: A note on makespan minimization in proportionate flow shops
zbMATH Open document ID: 1260.90088
author: Byung-Cheon Choi
author: Joseph Y.-T. Leung
author: Michael L. Pinedo
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6150231
zbMATH Keywords: combinatorial problems
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.10.016
OpenAlex ID: W2048896639
cites work: Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
cites work: A state-of-the-art review on scheduling with learning effects
cites work: Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Time-dependent scheduling
cites work: Flowshop-scheduling problems with makespan criterion: a review
cites work: Minimizing total completion time in a two-machine flowshop: Analysis of special cases
cites work: The three-machine proportionate flow shop problem with unequal machine speeds
cites work: A note on the proportionate flow shop with a bottleneck machine
cites work: Focused Scheduling in Proportionate Flowshops
cites work: Ordered Flow Shop Problems with no In-Process Waiting: Further Results
cites work: Q3525911
cites work: A survey of scheduling with controllable processing times
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
DOI: 10.1016/J.IPL.2010.10.016
description: scientific article; zbMATH DE number 6150231