Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds

DOI10.1080/00207540500268780zbMath1095.90037OpenAlexW2049955857MaRDI QIDQ5478829

Suk-Hun Yoon, Sung-Jin Chung, Byung-Cheon Choi

Publication date: 13 July 2006

Full work available at URL: https://doi.org/10.1080/00207540500268780

zbMATH Keywords

NP-completeMachine speedProportionate flow shopWeighted shortest processing timeWorst-case performance ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (3)

A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time

Cites Work

• Minimizing total weighted completion time in a proportionate flow shop
• Some results of the worst-case analysis for flow shop scheduling
• Generalized pairwise interchanges and machine scheduling
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• The three-machine proportionate flow shop problem with unequal machine speeds
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Focused Scheduling in Proportionate Flowshops
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Flowshop sequencing problem with ordered processing time matrices: A general case

This page was built for publication: Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds