๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Kunjung Lai; Peng-Hsiang Hsu; Ping-Ho Ting; Chin-Chia Wu

Book ID
112098007
Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
112 KB
Volume
24
Category
Article
ISSN
1090-8471

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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 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