scientific article

zbMath1274.90146MaRDI QIDQ2861538

Talel Ladhari, Mehdi Serairi, Anis Gharbi, Mohamed Kais Msakni

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001393

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (1)

The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies

Cites Work

• Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times

This page was built for publication: