Pages that link to "Item:Q421611"

The following pages link to Two-agent scheduling to minimize the total cost (Q421611):

Displaying 22 items.

• Two-agent scheduling in a flowshop (Q322895) (← links)
• A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
• Scheduling to minimize the maximum total completion time per machine (Q726222) (← links)
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
• Two-agent parallel-machine scheduling with rejection (Q1676363) (← links)
• A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
• A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms (Q1723459) (← links)
• A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)
• A just-in-time scheduling problem with two competing agents (Q2228372) (← links)
• Two competitive agents to minimize the weighted total late work and the total completion time (Q2243272) (← links)
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
• Two-agent scheduling on a single machine with release dates (Q2273652) (← links)
• A subset-sum type formulation of a two-agent single-machine scheduling problem (Q2281162) (← links)
• Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
• Scheduling two agents with sum-of-processing-times-based deterioration on a single machine (Q2453274) (← links)
• Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)
• Group Scheduling with Two Competing Agents on a Single Machine (Q5174413) (← links)
• Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures (Q5359060) (← links)
• Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)
• A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem (Q6114936) (← links)
• Two-agent scheduling in a two-machine open shop (Q6491675) (← links)