Two machine open shop scheduling problems with bi-criteria

DOI10.1016/0166-218X(94)90144-9zbMath0830.90072MaRDI QIDQ1331894

Teruo Masuda, Hiroaki Ishii

Publication date: 14 January 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithmsmaximum completion timemaximum latenessbi-criteria two machine open shop scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Two-machine open shop scheduling with secondary criteria ⋮ Multicriteria scheduling ⋮ Pareto and scalar bicriterion optimization in scheduling deteriorating jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Solving a bicriterion scheduling problem
• A bicriterion approach to time/cost trade-offs in sequencing
• On the interactive solution to a multicriteria scheduling problem
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Open Shop Scheduling to Minimize Finish Time