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.002MaRDI QIDQ2294263zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

approximation algorithmschedulingNP-hardflow shoptotal weighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• New results on the coordination of transportation and batching scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The coordination of transportation and batching scheduling

Cited in

(7)

• scientific article; zbMATH DE number 5732726 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 3974704 (Why is no real title available?)

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)