Pages that link to "Item:Q2385467"

The following pages link to A note on the complexity of the problem of two-agent scheduling on a single machine (Q2385467):

Displaying 50 items.

• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← 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 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)
• 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)
• 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)
• 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)
• 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)
• Complexities of four problems on two-agent scheduling (Q1653276) (← links)
• Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness (Q1666548) (← links)
• A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
• A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
• A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms (Q1723459) (← links)
• Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153) (← 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)
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
• Complexities of some problems on multi-agent scheduling on a single machine (Q2014052) (← links)
• Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← links)
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
• A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← links)
• Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
• Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
• A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518) (← links)
• A subset-sum type formulation of a two-agent single-machine scheduling problem (Q2281162) (← links)
• Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
• ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
• The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs (Q2286435) (← links)
• An approximation algorithm for multi-agent scheduling on two uniform parallel machines (Q2311120) (← links)