✦ LIBER ✦

A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

✍ Scribed by B. Naderi; S.M.T. Fatemi Ghomi; M. Aminnayeri

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 451 KB
Volume: 10
Category: Article
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2009.08.039

No coin nor oath required. For personal study only.

📜 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

Scheduling in a manufacturing shop with

Scheduling in a manufacturing shop with sequence-dependent setups

✍ Chen Zhou; Pius J. Egbelu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 686 KB

In this paper, the problem of scheduling multiple jobs in a flexible manufacturing cell with multiple machine stations is addressed. Due to the large capital investments that usually characterize flexible manufacturing systems (FMS), an area of control of great interest to system users is that of ma

A flow-shop problem with sequence-depend

A flow-shop problem with sequence-dependent additive setup times

✍ Wlodzimierz Szwarc; Jatinder N. D. Gupta 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 388 KB

Two machine flow shop scheduling problem

Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach

✍ Burton D. Corwin; Augustine O. Esogbue 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 605 KB

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

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