On algebraic characterizations in shop scheduling problems

MaRDI QIDQ5206667zbMATH OpenFDO

Authors Tanka Nath Dhamala

Publication date 18 December 2019

zbMATH Keywords

maximal ordershop problemssuper sequence group

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 7145128
• scientific article; zbMATH DE number 894720
• On the potentially optimal solutions of classical shop scheduling problems
• The complexity of cyclic shop scheduling problems
• The complexity of shop-scheduling problems with two or three jobs

Cited in

(3)

• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
• On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles
• scientific article; zbMATH DE number 7145128 (Why is no real title available?)

This page was built for publication: On algebraic characterizations in shop scheduling problems

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