Pages that link to "Item:Q1924612"

The following pages link to Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (Q1924612):

Displaying 36 items.

• Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan (Q300969) (← 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)
• Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost (Q457296) (← links)
• A note on unbounded parallel-batch scheduling (Q495685) (← links)
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← 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 DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835) (← links)
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan (Q995579) (← links)
• A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
• Scheduling with time-of-use costs (Q1755384) (← links)
• A note on Pareto minimizing total completion time and maximum cost (Q1785326) (← links)
• Common due date assignment and scheduling with ready times (Q1867095) (← links)
• A note on competing-agent Pareto-scheduling (Q1996756) (← links)
• Single machine batch scheduling with two non-disjoint agents and splitable jobs (Q2023129) (← links)
• Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
• Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
• Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) (Q2326400) (← links)
• Scheduling with release dates and preemption to minimize multiple max-form objective functions (Q2327626) (← links)
• Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
• Pareto optima for total weighted completion time and maximum lateness on a single machine (Q2457015) (← 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)
• BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN (Q2931723) (← links)
• A heuristic approach to bicriteria scheduling (Q4934193) (← links)
• Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923) (← links)
• Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
• Scheduling with target start times (Q5925938) (← links)
• A time-dependent multiple criteria single-machine scheduling problem (Q5954823) (← links)
• Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)
• Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates (Q6066663) (← links)
• Single-machine preemptive scheduling with release dates involving the total weighted late work criterion (Q6093999) (← links)
• Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine (Q6664884) (← links)