Pages that link to "Item:Q3637420"

The following pages link to Scheduling Problems with Two Competing Agents (Q3637420):

Displaying 50 items.

• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
• A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
• Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness (Q295879) (← links)
• Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
• Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan (Q300969) (← links)
• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
• A note on scheduling problems with competing agents and earliness minimization objectives (Q319703) (← links)
• Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling (Q320651) (← links)
• Two-agent scheduling in a flowshop (Q322895) (← links)
• Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
• A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
• Single machine scheduling with interfering job sets (Q336975) (← links)
• A scheduling problem with three competing agents (Q337134) (← links)
• Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria (Q337198) (← links)
• Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation (Q337206) (← links)
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
• Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589) (← links)
• An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
• Single machine scheduling problem with two synergetic agents and piece-rate maintenance (Q350484) (← links)
• Maximum latency scheduling problem on two-person cooperative games (Q358650) (← links)
• A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
• Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859) (← links)
• On bilevel machine scheduling problems (Q421065) (← links)
• A \((\mu ,\, \lambda )\)-coordination mechanism for agent-based multi-project scheduling (Q421082) (← links)
• Two-agent scheduling to minimize the total cost (Q421611) (← links)
• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties (Q454994) (← links)
• A competitive two-agent scheduling problem on parallel machines with release dates and preemption (Q460140) (← links)
• Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times (Q474643) (← links)
• A single-machine bi-criterion scheduling problem with two agents (Q482429) (← links)
• Single-machine scheduling with two competing agents and learning consideration (Q497627) (← links)
• Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
• Two-agent single-machine scheduling problems under increasing linear deterioration (Q552491) (← links)
• A single-machine scheduling problem with two-agent and deteriorating jobs (Q611543) (← links)
• Minimizing the number of late jobs on a single machine under due date uncertainty (Q657256) (← links)
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
• A two-machine flowshop problem with two agents (Q709115) (← links)
• Scheduling to minimize the maximum total completion time per machine (Q726222) (← links)
• Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634) (← 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)
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
• Two-agent single machine scheduling with forbidden intervals (Q902407) (← links)
• Optimal methods for batch processing problem with makespan and maximum lateness objectives (Q967805) (← links)
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483) (← links)
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
• Decentralized multi-level uncapacitated lot-sizing by automated negotiation (Q989827) (← links)
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan (Q995579) (← links)
• Scheduling interfering job sets on parallel machines (Q1042099) (← links)