Certain exact and approximate algorithms for solving precedence problems with constraints

DOI10.1007/BF01078824zbMATH Open0617.90032OpenAlexW2074870693MaRDI QIDQ3754412FDOQ3754412

Authors: A. E. Serik 

Publication date: 1985

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01078824

Recommendations

• scientific article; zbMATH DE number 4010200
• Permutation Schedules for Flow Shops with Precedence Constraints
• Algorithms for two-machine flow-shop sequencing with precedence constraints
• An algorithm for minimizing setups in precedence constrained scheduling
• A Precedence Graph Algorithm for the Shop Scheduling Problem

zbMATH Keywords

queueingservice modelsoptimal permutation problemprecedence intervals method

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Using precedence intervals to solve constrained precedence problems

Cited In (5)

• Title not available (Why is that?)
• On the complexity of the Eulerian closed walk with precedence path constraints problem
• On the complexity of the Eulerian closed walk with precedence path constraints problem
• Title not available (Why is that?)
• A constraint programming approach for the premarshalling problem

This page was built for publication: Certain exact and approximate algorithms for solving precedence problems with constraints

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