Pages that link to "Item:Q976351"

The following pages link to Scheduling two agents with controllable processing times (Q976351):

Displaying 43 items.

• Two-agent scheduling in a flowshop (Q322895) (← links)
• Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
• Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
• Single machine scheduling with interfering job sets (Q336975) (← links)
• Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria (Q337198) (← 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)
• 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)
• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties (Q454994) (← links)
• A single-machine bi-criterion scheduling problem with two agents (Q482429) (← links)
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent (Q827243) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← 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)
• Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
• Single machine resource allocation scheduling problems with deterioration effect and general positional effect (Q1981261) (← links)
• A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)
• Two-agent integrated scheduling of production and distribution operations with fixed departure times (Q2076366) (← links)
• Due date assignment and two-agent scheduling under multitasking environment (Q2084604) (← links)
• Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
• Two competitive agents to minimize the weighted total late work and the total completion time (Q2243272) (← 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)
• Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
• An approximation algorithm for multi-agent scheduling on two uniform parallel machines (Q2311120) (← links)
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work (Q2359798) (← links)
• Scheduling with two competing agents to minimize total weighted earliness (Q2399317) (← links)
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
• Two-agent scheduling of time-dependent jobs (Q2410089) (← links)
• Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← 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)
• Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures (Q2931176) (← links)
• A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← 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‐agent scheduling with linear resource‐dependent processing times (Q6072167) (← links)
• Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)
• Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization (Q6657877) (← links)
• Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria (Q6669316) (← links)