Solving a bicriterion scheduling problem
From MaRDI portal
Publication:1131944
DOI10.1016/0377-2217(80)90038-7zbMath0418.90054OpenAlexW2015869032MaRDI QIDQ1131944
L. F. Gelders, Luk N. Van Wassenhove
Publication date: 1979
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(80)90038-7
computational complexityjob sequencingsingle machineholding costmaximum tardinesspseudo-polynomial algorithmbicriterion scheduling problem
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Two-machine flow shop scheduling with two criteria: maximum earliness and makespan, Two machine open shop scheduling problems with bi-criteria, An interactive procedure for bi-criteria production scheduling, Incorporating preference information into multi-objective scheduling, A bicriterion scheduling problem involving total flowtime and total tardiness, A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process, Solving multi-objective production scheduling problems using metaheuristics, A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems, Multicriteria scheduling using fuzzy theory and tabu search, An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness, A heuristic approach to bicriteria scheduling, On the existence of schedules that are near-optimal for both makespan and total weighted completion time, Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty, A bi-criterion algorithm for minimizing machine interference and reducing job waiting time, Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time, Multiple and bicriteria scheduling: A literature survey, Pareto minimizing total completion time and maximum cost with positional due indices, Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine, A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure, A bicriterion approach to time/cost trade-offs in sequencing, Range of lower bounds, A state-of-the-art review of parallel-machine scheduling research, Unnamed Item, Bicriteria scheduling with vacations on a single machine, Single-machine scheduling with maintenance in a manufacturing system, Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost, Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine, Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming, A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization, Use of variable range in solving multiple criteria scheduling problems, Scheduling with target start times, Minimizing mean squared deviation of completion times with maximum tardiness constraint, Tradeoff between setup times and carrying costs for finished items, A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling, A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates, Multicriteria scheduling problems: a survey, Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments, On the interactive solution to a multicriteria scheduling problem, A note on Pareto minimizing total completion time and maximum cost, Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion, Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness, Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions, A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment, A bicriteria approach to the two-machine flow shop scheduling problem, An interactive decision support system for the resource constrained scheduling problem, Genetic algorithms for the two-stage bicriteria flowshop problem, Scheduling unit processing time jobs on a single machine with multiple criteria, Outer Branching: How to Optimize under Partial Orders?, Multicriteria scheduling, Complexity of single machine, multi-criteria scheduling problems, Some remarks about the `equivalence' of performance measures in scheduling problems, Analysis of multicriteria decision aid in Europe
Cites Work
