Pages that link to "Item:Q2508983"

The following pages link to Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs (Q2508983):

Displaying 50 items.

• A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← 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)
• 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)
• A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
• Single machine scheduling problem with two synergetic agents and piece-rate maintenance (Q350484) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
• Resource constraint scheduling with a fractional shared resource (Q408404) (← links)
• Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859) (← 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)
• 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)
• 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)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483) (← links)
• Scheduling interfering job sets on parallel machines (Q1042099) (← links)
• Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities (Q1639885) (← links)
• Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
• A lower bound for minimizing the total completion time of a three-agent scheduling problem (Q1671716) (← links)
• Decentralised scheduling with confidentiality protection (Q1694787) (← links)
• A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
• Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost (Q1706684) (← links)
• A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms (Q1723459) (← links)
• Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs (Q1751210) (← links)
• Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153) (← links)
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives (Q1788999) (← links)
• Approximation schemes for two-machine flow shop scheduling with two agents (Q1928514) (← links)
• Two-agent single-machine scheduling with cumulative deterioration (Q2001202) (← links)
• A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← 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)