Pages that link to "Item:Q2385467"

The following pages link to A note on the complexity of the problem of two-agent scheduling on a single machine (Q2385467):

Displaying 21 items.

• Scheduling with release dates and preemption to minimize multiple max-form objective functions (Q2327626) (← links)
• Two-agent scheduling with rejection on a single machine (Q2337544) (← links)
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work (Q2359798) (← links)
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
• Two-agent scheduling of time-dependent jobs (Q2410089) (← links)
• A note on a two-agent scheduling problem related to the total weighted late work (Q2424661) (← links)
• Scheduling two agents on uniform parallel machines with~makespan and cost functions (Q2434250) (← links)
• Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
• Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
• Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
• A single-machine two-agent scheduling problem by GA approach (Q2911577) (← links)
• Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures (Q2931176) (← links)
• SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN (Q3114615) (← links)
• (Q3462919) (← links)
• Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs (Q5012893) (← links)
• Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
• Group Scheduling with Two Competing Agents on a Single Machine (Q5174413) (← links)
• Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration (Q5174416) (← links)
• Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
• Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)