Pages that link to "Item:Q2014052"

The following pages link to Complexities of some problems on multi-agent scheduling on a single machine (Q2014052):

Displaying 12 items.

• A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan (Q1991261) (← links)
• Two-agent single-machine scheduling with cumulative deterioration (Q2001202) (← links)
• Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← links)
• Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (Q2081468) (← links)
• Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives (Q2176838) (← links)
• Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
• Serial-batching scheduling with two agents to minimize makespan and maximum cost (Q2215193) (← links)
• ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
• Scheduling with release dates and preemption to minimize multiple max-form objective functions (Q2327626) (← links)
• A note on a two-agent scheduling problem related to the total weighted late work (Q2424661) (← 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)