Scheduling with two competing agents to minimize total weighted earliness

Single machine scheduling with two competing agents and equal job processing times

(2015) Daniel Oron et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures

(2014) Shuenn-Ren Cheng   ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH

Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria

(2014) Stanisław Gawiejnowicz et al.   COMPUTERS & OPERATIONS RESEARCH

Some new problems on two-agent scheduling to minimize the earliness costs

(2014) Shuenn-Ren Cheng   INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS

Single machine just-in-time scheduling problems with two competing agents

(2013) Enrique Gerstl et al.   NAVAL RESEARCH LOGISTICS

Two-agent scheduling on uniform parallel machines with min-max criteria

(2012) Donatas Elvikis et al.   ANNALS OF OPERATIONS RESEARCH

Two-agent singe-machine scheduling with release times to minimize the total weighted completion time

(2012) T.C.E. Cheng et al.   COMPUTERS & OPERATIONS RESEARCH

Scheduling problems with two competing agents to minimized weighted earliness–tardiness

(2012) Enrique Gerstl et al.   COMPUTERS & OPERATIONS RESEARCH

Solving a two-agent single-machine scheduling problem considering learning effect

(2011) Der-Chiang Li et al.   COMPUTERS & OPERATIONS RESEARCH

Single machine batch scheduling with two competing agents to minimize total flowtime

(2011) Baruch Mor et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

(2011) Yunqiang Yin et al.   INFORMATION SCIENCES

Scheduling problems with two competing agents to minimize minmax and minsum earliness measures

(2010) Baruch Mor et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Scheduling two agents with controllable processing times

(2010) Guohua Wan et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications

(2008) Hans Kellerer et al.   ALGORITHMICA