scientific article
From MaRDI portal
Publication:4002567
zbMath0749.90042MaRDI QIDQ4002567
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
bicriteria schedulingbranch-and-boundcommon due datesingle machine schedulingpolynomial time algorithmsmulticriteria schedulingmean flow timetotal weighted earlinesstotal weighted flow timemaximum earliness and lateness
Related Items
Solving multi-objective production scheduling problems using metaheuristics ⋮ An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem ⋮ A heuristic approach to bicriteria scheduling ⋮ Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time ⋮ Single-machine multi-agent scheduling problems with a global objective function ⋮ On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. ⋮ Proportionate flow shop with controllable processing times ⋮ Multi‐objective combinatorial optimization problems: A survey ⋮ Scheduling with target start times ⋮ Single-machine scheduling under the job rejection constraint ⋮ Multicriteria scheduling problems: a survey ⋮ Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry ⋮ Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs ⋮ Local search heuristics for two-stage flow shop problems with secondary criterion ⋮ An approximation scheme for the bi-scenario sum of completion times trade-off problem ⋮ Exploiting process plan flexibility in production scheduling: A multi-objective approach ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Approximation results for a bicriteria job scheduling problem on a single machine without preemption ⋮ Multicriteria scheduling ⋮ Pareto and scalar bicriterion optimization in scheduling deteriorating jobs ⋮ An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem ⋮ Finding the Pareto-optima for the total and maximum tardiness single machine problem ⋮ Using genetic algorithms for single-machine bicriteria scheduling problems
