Flow shop scheduling problems under machine-dependent precedence constraints

DOI10.1023/B:JOCO.0000021935.66577.09MaRDI QIDQ1768595zbMATH OpenOpenAlexFDO

Authors Xianqiang Yang

Publication date 15 March 2005

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:joco.0000021935.66577.09

zbMATH Keywords

complexitypolynomial-time algorithmflow shopprecedence constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 1264301
• The two-machine flow shop problem with arbitrary precedence relations
• Algorithms for two-machine flow-shop sequencing with precedence constraints
• The three-machine flow-shop problem with arbitrary precedence relations
• One-machine generalized precedence constrained scheduling problems

Cited in

(26)

• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines
• Decision diagrams for solving a job scheduling problem under precedence constraints
• Two-dedicated-machine scheduling problem with precedence relations to minimize makespan
• Flow shop scheduling problem with conflict graphs
• scientific article; zbMATH DE number 2186529 (Why is no real title available?)
• A Precedence Graph Algorithm for the Shop Scheduling Problem
• Reduction of job-shop problems to flow-shop problems with precedence constraints
• Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
• Optimal four-machine flow shop scheduling with dominance condition
• A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements
• Flow shops with machine maintenance: ordered and proportionate cases
• scientific article; zbMATH DE number 1054688 (Why is no real title available?)
• The m-machine flowshop problem with unit-time operations and intree precedence constraints
• Complexity of flowshop scheduling problems with a new blocking constraint
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• The three-machine flow-shop problem with arbitrary precedence relations
• One-machine generalized precedence constrained scheduling problems
• scientific article; zbMATH DE number 4087409 (Why is no real title available?)
• Algorithms for two-machine flow-shop sequencing with precedence constraints
• Minimizing the makespan in a two-machine cross-docking flow shop problem
• Nonpreemptive flowshop scheduling with machine dominance
• Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
• Vyacheslav Tanaev: contributions to scheduling and related areas
• Preemptive hybrid flowshop scheduling problem of interval orders
• scientific article; zbMATH DE number 4185379 (Why is no real title available?)

This page was built for publication: Flow shop scheduling problems under machine-dependent precedence constraints

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