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

DOI10.1016/0898-1221(90)90214-5zbMath0716.90056OpenAlexW1995353009MaRDI QIDQ753673

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

zbMATH Keywords

precedence constraintslinear extensionbump numberflow-shop scheduling

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing bumps in linear extensions of ordered sets
• Greedy posets for the bump-minimizing problem
• Computing the bump number is easy
• Computing the bump number with techniques from two-processor scheduling
• Minimizing bumps in ordered sets by substitution decomposition
• A comparison of algorithms for minimizing bumps in linear extensions of partial orders
• Optimal two- and three-stage production schedules with setup times included
• On Some Variants of the Bandwidth Minimization Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

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