Pages that link to "Item:Q1131944"

The following pages link to Solving a bicriterion scheduling problem (Q1131944):

Displaying 50 items.

• An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem (Q336962) (← links)
• Range of lower bounds (Q648257) (← links)
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
• Tradeoff between setup times and carrying costs for finished items (Q690011) (← links)
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
• Pareto minimizing total completion time and maximum cost with positional due indices (Q888315) (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
• Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions (Q1011174) (← links)
• Analysis of multicriteria decision aid in Europe (Q1075249) (← links)
• A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems (Q1096529) (← links)
• Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty (Q1121167) (← links)
• Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
• A bicriterion approach to time/cost trade-offs in sequencing (Q1162923) (← links)
• Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine (Q1184462) (← links)
• Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming (Q1185994) (← links)
• Use of variable range in solving multiple criteria scheduling problems (Q1200841) (← links)
• An interactive decision support system for the resource constrained scheduling problem (Q1278271) (← links)
• Genetic algorithms for the two-stage bicriteria flowshop problem (Q1278393) (← links)
• Complexity of single machine, multi-criteria scheduling problems (Q1309989) (← links)
• Some remarks about the `equivalence' of performance measures in scheduling problems (Q1310028) (← links)
• Two machine open shop scheduling problems with bi-criteria (Q1331894) (← links)
• An interactive procedure for bi-criteria production scheduling (Q1332798) (← links)
• Incorporating preference information into multi-objective scheduling (Q1333459) (← links)
• A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process (Q1341405) (← links)
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
• A note on Pareto minimizing total completion time and maximum cost (Q1785326) (← links)
• A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment (Q1806642) (← links)
• A bicriteria approach to the two-machine flow shop scheduling problem (Q1807949) (← links)
• Scheduling unit processing time jobs on a single machine with multiple criteria (Q1823849) (← links)
• Two-machine flow shop scheduling with two criteria: maximum earliness and makespan (Q1877048) (← links)
• Solving multi-objective production scheduling problems using metaheuristics (Q1887769) (← links)
• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (Q1924612) (← links)
• Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates (Q2489138) (← links)
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
• Multicriteria scheduling problems: a survey (Q2773166) (← links)
• Bicriteria scheduling with vacations on a single machine (Q2997965) (← links)
• Single-machine scheduling with maintenance in a manufacturing system (Q2997966) (← links)
• A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization (Q3305119) (← links)
• Outer Branching: How to Optimize under Partial Orders? (Q3649598) (← links)
• A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure (Q3778533) (← links)
• On the interactive solution to a multicriteria scheduling problem (Q3863679) (← links)
• A bi-criterion algorithm for minimizing machine interference and reducing job waiting time (Q4018422) (← links)
• (Q4212972) (← links)
• A bicriterion scheduling problem involving total flowtime and total tardiness (Q4264495) (← links)
• A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness (Q4297161) (← links)
• A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling (Q4398900) (← links)