Pages that link to "Item:Q1309989"

The following pages link to Complexity of single machine, multi-criteria scheduling problems (Q1309989):

Displaying 34 items.

• Total completion time minimization on multiple machines subject to machine availability and makespan constraints (Q319146) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines (Q391787) (← links)
• Multi-criteria scheduling: an agent-based approach for expert knowledge integration (Q398857) (← links)
• Bi-criteria scheduling on a single parallel-batch machine (Q437901) (← links)
• Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints (Q631768) (← links)
• On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556) (← links)
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
• Two machine scheduling under disruptions with transportation considerations (Q880527) (← links)
• Bicriterion scheduling with equal processing times on a batch processing machine (Q947947) (← links)
• New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (Q1044141) (← links)
• Genetic algorithms for the two-stage bicriteria flowshop problem (Q1278393) (← links)
• A bicriteria two-machine permutation flowshop problem (Q1296104) (← links)
• Minimizing makespan subject to minimum total flow-time on identical parallel machines (Q1580983) (← links)
• On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
• Scheduling with time-of-use costs (Q1755384) (← links)
• Minimizing total completion time and total deviation of job completion times from a restrictive due-date (Q1776951) (← links)
• Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123) (← links)
• Using genetic algorithms for single-machine bicriteria scheduling problems (Q1869489) (← links)
• Simultaneous minimization of total completion time and total deviation of job completion times (Q1877049) (← links)
• Solving multi-objective production scheduling problems using metaheuristics (Q1887769) (← links)
• Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
• Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs (Q2378377) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs (Q2566704) (← links)
• Complexity of two dual criteria scheduling problems (Q2643797) (← links)
• Multicriteria scheduling problems: a survey (Q2773166) (← links)
• BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS (Q3397512) (← links)
• Multicriteria scheduling using fuzzy theory and tabu search (Q4807191) (← links)
• Minimizing flowtime subject to optimal makespan on two identical parallel machines (Q5189089) (← links)
• Minimizing makespan subject to minimum flowtime on two identical parallel machines (Q5939974) (← links)
• Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines (Q6193885) (← links)