Two machine open shop scheduling problems with bi-criteria
From MaRDI portal
Publication:1331894
DOI10.1016/0166-218X(94)90144-9zbMath0830.90072MaRDI QIDQ1331894
Publication date: 14 January 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
polynomial algorithms; maximum completion time; maximum lateness; bi-criteria two machine open shop scheduling
90C60: Abstract computational complexity for mathematical programming problems
90C05: Linear programming
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Multicriteria scheduling, Pareto and scalar bicriterion optimization in scheduling deteriorating jobs, Two-machine open shop scheduling with secondary criteria
Cites Work