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

Scheduling flowshops with finite buffers and sequence-dependent setup times

โœ Scribed by Bryan A Norman

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
145 KB
Volume
36
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 consider heuristic solution methods. We propose a tabu search based solution procedure. Computational results demonstrate the eectiveness of this approach relative to the other methods discussed.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling jobs on parallel machines wit
Scheduling jobs on parallel machines with sequence-dependent setup times
โœ Young Hoon Lee; Michael Pinedo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 855 KB

Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the

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

Single machine scheduling with exponenti
Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
โœ Ji-Bo Wang; Dan Wang; Li-Yan Wang; Lin Lin; Na Yin; Wei-Wei Wang ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 472 KB

In this paper we consider the single machine scheduling problem with exponential time-dependent learning effect and past-sequence-dependent (p-s-d) setup times. By the exponential time-dependent learning effect, we mean that the processing time of a job is defined by an exponent function of the tota