Pages that link to "Item:Q976483"

The following pages link to Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483):

Displaying 41 items.

• 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)
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← 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 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)
• Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← 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)
• Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
• Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153) (← 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)
• Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
• A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← 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)
• 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)
• Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design (Q2327696) (← 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)
• 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)
• SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN (Q3114615) (← links)
• A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← links)
• Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
• Multitasking scheduling problems with two competitive agents (Q5059462) (← 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)
• An Ordered Flow Shop with Two Agents (Q5506757) (← links)
• Two-agent scheduling in a two-machine open shop (Q6491675) (← links)