Pages that link to "Item:Q2359798"

The following pages link to Two-agent scheduling problems on a single-machine to minimize the total weighted late work (Q2359798):

Displaying 31 items.

• Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589) (← links)
• A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
• Two-agent single-machine scheduling with resource-dependent starting times (Q474145) (← links)
• Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
• A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
• Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
• Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← links)
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
• Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
• Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
• A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← links)
• Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
• Two competitive agents to minimize the weighted total late work and the total completion time (Q2243272) (← links)
• Two-agent single-machine scheduling problem with just-in-time jobs (Q2250441) (← links)
• Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
• Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans (Q2410095) (← links)
• A note on a two-agent scheduling problem related to the total weighted late work (Q2424661) (← links)
• Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
• Two-agent single machine scheduling problem with the total weighted early work (Q3381063) (← links)
• (Q3462919) (← links)
• A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← links)
• Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs (Q5012893) (← links)
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)
• (Q5234786) (← links)
• Two-agent scheduling problem about tardiness on a single machine (Q5381472) (← links)
• Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work (Q6076476) (← links)
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
• Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)
• Two-agent single-machine scheduling with a rate-modifying activity (Q6087481) (← links)
• Single-machine preemptive scheduling with release dates involving the total weighted late work criterion (Q6093999) (← links)
• Two-agent scheduling in a two-machine open shop (Q6491675) (← links)