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.002zbMATH Open1476.90134OpenAlexW2905457258WikidataQ128762239 ScholiaQ128762239MaRDI QIDQ2294263FDOQ2294263

Authors: 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

Recommendations

• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
• Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
• Two-machine flow-shop scheduling problems with minimizing the total completion times
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases

zbMATH Keywords

approximation algorithmschedulingNP-hardflow shoptotal weighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• The coordination of transportation and batching scheduling
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
• New results on the coordination of transportation and batching scheduling

Cited In (7)

• Title not available (Why is that?)
• On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
• An exact algorithm for the preemptive single machine scheduling of equal-length jobs
• Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294263)