An ordered independence system and its applications to scheduling problems

DOI10.1016/0377-2217(94)90217-8zbMath0823.90104OpenAlexW2056704763MaRDI QIDQ1330565

Yanpei Liu

Publication date: 18 August 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90217-8

zbMATH Keywords

matroidgraph optimizationcircuit-breaking algorithmindependence system on a finite ordered set

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An ordered independence system and its applications to scheduling problems