Open shop scheduling with makespan and total completion time criteria

DOI10.1016/S0305-0548(99)00005-2zbMATH Open0959.90022OpenAlexW2045363538MaRDI QIDQ1818565FDOQ1818565

C. Koulamas, George J. Kyparisis

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

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

Cited In (5)

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

Recommendations

• Scheduling open shops with parallel machines to minimize total completion time 👍 👎
• Open shop scheduling with machine dependent processing times 👍 👎
• Flexible open shop scheduling problem to minimize makespan 👍 👎
• Open shop scheduling problem to minimize makespan with release dates 👍 👎
• Open shop scheduling with delays 👍 👎
• Openshop and flowshop scheduling to minimize sum of completion times 👍 👎
• Open shop scheduling with synchronization 👍 👎
• The Open Shop Scheduling Problem 👍 👎
• Open shop scheduling with some additional constraints 👍 👎
• Scheduling Unit-Time Open Shops with Deadlines 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818565)