A single-machine problem with multiple criteria

DOI<721::AID-NAV3220380507>3.0.CO;2-4 10.1002/1520-6750(199110)38:5<721::AID-NAV3220380507>3.0.CO;2-4zbMath0755.90045OpenAlexW2082912437MaRDI QIDQ3987786

Ali S. Kiran, Ali Tamer Ünal

Publication date: 28 June 1992

Full work available at URL: https://doi.org/10.1002/1520-6750(199110)38:5<721::aid-nav3220380507>3.0.co;2-4

zbMATH Keywords

single machinemultiple criteriatotal flow timenumber of tardy jobslower bound on the number of efficient sequences

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Bicriteria scheduling with vacations on a single machine ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion ⋮ A bicriteria approach to the two-machine flow shop scheduling problem ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs ⋮ Using genetic algorithms for single-machine bicriteria scheduling problems