Complexity of problem TF2|v=1,c=2|C_

DOI10.1016/J.IPL.2015.09.003MaRDI QIDQ888964zbMATH OpenOpenAlexFDO

Authors Yan Lan, Xin Han, Zongtao Wu, He Guo, Xin Chen

Publication date 5 November 2015

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2015.09.003

zbMATH Keywords

optimizationanalysis of algorithmsNP-hardnessflow shop schedulinginterstage transporter

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 2117169
• A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
• Complexity and approximability of parameterized MAX-CSPs
• Complexity and Approximability of Parameterized MAX-CSPs
• The Complexity of theA B CProblem
• The Parameterized Complexity of Maximality and Minimality Problems
• The parameterized complexity of maximality and minimality problems
• The complexity of selecting maximal solutions
• Complexity of the maximum \(k\)-path vertex cover problem
• scientific article; zbMATH DE number 1496855

Cites work

• scientific article; zbMATH DE number 3689114 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• A heuristic for the two-machine open-shop scheduling problem with transportation times
• AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
• Approximability of flow shop scheduling
• Complexity results for flow-shop and open-shop scheduling problems with transportation delays
• Machine scheduling with transportation considerations
• Makespan minimization for flow-shop problems with transportation times and a single robot
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• Open shop scheduling with delays
• Optimal two- and three-stage production schedules with set-up time included
• Shop Problems With Two Machines and Time Lags
• Transporting jobs through a two‐machine open shop
• Two-machine open shop scheduling with special transportation times

Cited in

(7)

• Complexity of flow shop scheduling problems with transportation constraints
• Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines
• Flow shop scheduling problems with transportation constraints revisited
• Flow shop scheduling problems with transportation constraints revisited
• An improved approximation algorithm for a scheduling problem with transporter coordination
• A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
• Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited

This page was built for publication: Complexity of problem \(TF2|v=1,c=2|C_{\max}\)

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