Lower and upper bounds for the optimal makespan in the multimedia problem

zbMATH Open1324.90060MaRDI QIDQ5263761FDOQ5263761

P. A. Kononova

Publication date: 17 July 2015

Full work available at URL: http://mathnet.ru/eng/da677

zbMATH Keywords

local searchschedulingflow shop problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Cited In (1)

• An improved lower bound for the multimedian location problem

   Recommendations

• Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications 👍 👎
• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations 👍 👎
• A general lower bound for the makespan problem 👍 👎
• A computational study of the permutation flow shop problem based on a tight lower bound 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Lower and upper bounds for the optimal makespan in the multimedia problem

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