Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time

DOI10.1016/j.orl.2018.12.002zbMath1476.90134OpenAlexW2905457258WikidataQ128762239 ScholiaQ128762239MaRDI QIDQ2294263

Hongjun Wei, Jinjiang Yuan

Publication date: 10 February 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2018.12.002

zbMATH Keywords

schedulingapproximation algorithmflow shopNP-hardtotal weighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

An exact algorithm for the preemptive single machine scheduling of equal-length jobs ⋮ On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine

Cites Work

• Unnamed Item
• The coordination of transportation and batching scheduling
• New results on the coordination of transportation and batching scheduling
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds

This page was built for publication: Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time