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

Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times

โœ Scribed by S. Afshin Mansouri; S. Hamed Hendizadeh; Nasser Salmasi

Publisher
Springer
Year
2008
Tongue
English
Weight
484 KB
Volume
40
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling flowshops with finite buffers
Scheduling flowshops with finite buffers and sequence-dependent setup times
โœ Bryan A Norman ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 145 KB

In this paper we explore ยฏowshop scheduling problems containing both sequence-dependent setup times and ยฎnite buers. To the best of our knowledge, problems containing both of these complexities have not been addressed previously in the literature. The problem is clearly NP-hard and therefore we only

Single machine scheduling with past-sequ
Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs
โœ Chuanli Zhao; Hengyong Tang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 180 KB

This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed that the job processing times are defined by func