✦ LIBER ✦

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

✍ Scribed by Cheng, Shuenn-Ren

Book ID: 124130995
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 309 KB
Volume: 156
Category: Article
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2014.05.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-agent scheduling to minimize the tot

Two-agent scheduling to minimize the total cost

✍ Q.Q. Nong; T.C.E. Cheng; C.T. Ng 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Scheduling problems with two competing a

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

✍ Gerstl, Enrique; Mosheiov, Gur 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 474 KB

Scheduling problems with two agents and

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

✍ Yunqiang Yin; Shuenn-Ren Cheng; Chin-Chia Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Parallel machine scheduling problem to m

Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs

✍ M. Duran Toksarı; Ertan Güner 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 201 KB

Some new results on simulated annealing

Some new results on simulated annealing applied to the job shop scheduling problem

✍ M. Kolonko 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 256 KB

We present two results about heuristic solutions to the job shop scheduling problem (JSP). First, we show that the well-known analytical results on convergence of simulated annealing (SA) do not hold in the application to the JSP. We give a simple counterexample where the SA process converges agains

[IEEE 2013 5th International Conference

[IEEE 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO 2013) - Hammamet (2013.4.28-2013.4.30)] 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO) - New lower bounds for the blocking flowshop scheduling problem to minimize the total completion time criterion

✍ Toumi, Said; Jarboui, Bassem; Eddaly, Mansour; Rebai, Abdelwaheb 📂 Article 📅 2013 🏛 IEEE ⚖ 130 KB