Open shop scheduling with makespan and total completion time criteria

DOI10.1016/S0305-0548(99)00005-2zbMath0959.90022OpenAlexW2045363538MaRDI QIDQ1818565

Christos P. Koulamas, Kyparisis, George J.

Publication date: 15 February 2000

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00005-2

zbMATH Keywords

heuristicsworst-case performanceopen shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop ⋮ Two-machine open shop scheduling with secondary criteria ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Multicriteria scheduling

This page was built for publication: Open shop scheduling with makespan and total completion time criteria