scientific article; zbMATH DE number 1008459

MaRDI QIDQ4336213zbMATH OpenFDO

Authors V. A. Strusevich

Publication date 22 April 1998

zbMATH Keywords

flow shopjob shopmakespanNP-hardopen shoppolynomial-time algorithmsprecedence constraintssuper shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Shop scheduling problems under precedence constraints
• scientific article; zbMATH DE number 1264301
• Flow shop scheduling problems under machine-dependent precedence constraints
• Open shop scheduling with some additional constraints
• On the complexity of preemptive open-shop scheduling problems

Cited in

(10)

• Shop scheduling problems under precedence constraints
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
• On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Vyacheslav Tanaev: contributions to scheduling and related areas
• scientific article; zbMATH DE number 3883928 (Why is no real title available?)
• Two-Machine Super-Shop Scheduling Problem
• scientific article; zbMATH DE number 1264301 (Why is no real title available?)
• scientific article; zbMATH DE number 5260995 (Why is no real title available?)
• Preemptive hybrid flowshop scheduling problem of interval orders

This page was built for publication:

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