Pages that link to "Item:Q1702733"

The following pages link to Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733):

Displaying 21 items.

• Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
• Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
• Mirror scheduling problems with early work and late work criteria (Q2066692) (← links)
• Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
• Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855) (← links)
• Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
• Semi-online early work maximization problem on two hierarchical machines with partial information of processing time (Q2151369) (← links)
• A common approximation framework for early work, late work, and resource leveling problems (Q2184097) (← links)
• Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
• Fair task allocation problem (Q2288963) (← links)
• Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
• A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work (Q5024913) (← links)
• Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)
• A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work (Q6054012) (← links)
• Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
• Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time (Q6084675) (← links)
• Exact approaches to late work scheduling on unrelated machines (Q6093431) (← links)
• Single-machine preemptive scheduling with release dates involving the total weighted late work criterion (Q6093999) (← links)
• Dynamic scheduling of patients in emergency departments (Q6113312) (← links)
• A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)