✦ LIBER ✦

A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function

✍ Scribed by Chin-Chia Wu; Wen-Hung Wu; Peng-Hsiang Hsu; Kunjung Lai

Book ID: 116233594
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 219 KB
Volume: 36
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2011.12.038

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A truncated sum of processing-times-base

A truncated sum of processing-times-based learning model for a two-machine flowshop scheduling problem

✍ Kunjung Lai; Peng-Hsiang Hsu; Ping-Ho Ting; Chin-Chia Wu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

A two-agent single-machine scheduling pr

A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations

✍ T.C.E. Cheng; Shuenn-Ren Cheng; Wen-Hung Wu; Peng-Hsiang Hsu; Chin-Chia Wu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Scheduling with learning effects has received a lot of research attention lately. By learning effect, we mean that job processing times can be shortened through the repeated processing of similar tasks. On the other hand, different entities (agents) interact to perform their respective tasks, negoti

A two-machine flowshop maximum tardiness

A two-machine flowshop maximum tardiness scheduling problem with a learning effect

✍ Chin-Chia Wu; Wen-Chiung Lee; Wei-Chieh Wang 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 168 KB

Single machine scheduling with exponenti

Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect

✍ Ji-Bo Wang; Linhui Sun; Linyan Sun 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 176 KB

A two-criteria objective function flexib

A two-criteria objective function flexible flowshop scheduling problem with machine eligibility constraint

✍ Tadayon, Bita; Salmasi, Nasser 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 493 KB

A generalized two-machine flowshop sched

A generalized two-machine flowshop scheduling problem with processing time linearly dependent on job waiting-time

✍ Dar-Li Yang; Maw-Sheng Chern 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 192 KB

We consider a two-machine ¯owshop scheduling problem where the processing times are linearly dependent on the waiting times of the jobs. The objective is to minimize the makespan. A 0±1 mixed integer program and a heuristic algorithm are proposed. Some cases solved in polynomial time and computation