Pages that link to "Item:Q892842"

The following pages link to Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842):

Displaying 18 items.

• Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent (Q827243) (← links)
• Single-machine serial-batch delivery scheduling with two competing agents and due date assignment (Q829197) (← links)
• Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
• Two-agent single-machine scheduling with cumulative deterioration (Q2001202) (← links)
• Two-agent integrated scheduling of production and distribution operations with fixed departure times (Q2076366) (← links)
• Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost (Q2081468) (← links)
• Mixed batch scheduling on identical machines (Q2197328) (← 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)
• Improved algorithms for two-agent scheduling on an unbounded serial-batching machine (Q2234745) (← links)
• Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
• Minimizing maximum tardiness on a single machine with family setup times and machine disruption (Q2668648) (← links)
• A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← links)
• Multitasking scheduling problems with two competitive agents (Q5059462) (← links)
• Two‐agent scheduling with linear resource‐dependent processing times (Q6072167) (← links)
• Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)
• Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives (Q6186161) (← links)