A simulated annealing approach to bicriteria scheduling problems on a single machine
From MaRDI portal
Publication:2567887
DOI10.1023/A:1009622230725zbMath1071.90536OpenAlexW1570754966MaRDI QIDQ2567887
Murat M. Köksalan, Esra Köktener Karasakal
Publication date: 13 October 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009622230725
heuristicsbicriteria schedulingflowtimesimulated annealingsingle machine schedulingnumber of tardy jobsmaximum earliness
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Multi‐objective optimization using metaheuristics: non‐standard algorithms ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs ⋮ Multicriteria scheduling ⋮ Using genetic algorithms for single-machine bicriteria scheduling problems
