The connection between the bump number problem and flow-shop scheduling with precedence constraints

DOI10.1016/0898-1221(90)90214-5zbMATH Open0716.90056OpenAlexW1995353009MaRDI QIDQ753673FDOQ753673

Authors: D. Kharzeev 

Publication date: 1990

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(90)90214-5

Recommendations

• Computing the bump number with techniques from two-processor scheduling
• Computing the bump number is easy
• Permutation Schedules for Flow Shops with Precedence Constraints
• scientific article; zbMATH DE number 221764
• scientific article; zbMATH DE number 1264301

zbMATH Keywords

precedence constraintslinear extensionbump numberflow-shop scheduling

Mathematics Subject Classification ID

Individual preferences (91B08) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal two- and three-stage production schedules with set-up time included
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Some Variants of the Bandwidth Minimization Problem
• Minimizing bumps in linear extensions of ordered sets
• Computing the bump number is easy
• Computing the bump number with techniques from two-processor scheduling
• Title not available (Why is that?)
• Greedy posets for the bump-minimizing problem
• Minimizing bumps in ordered sets by substitution decomposition
• A comparison of algorithms for minimizing bumps in linear extensions of partial orders
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Computing the bump number with techniques from two-processor scheduling

This page was built for publication: The connection between the bump number problem and flow-shop scheduling with precedence constraints

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