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

A robust simulated annealing heuristic for flow shop scheduling problems

โœ Scribed by Chinyao Low; Jinn-Yi Yeh; Kai-I Huang

Publisher
Springer
Year
2004
Tongue
English
Weight
203 KB
Volume
23
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A batch splitting heuristic for dynamic
A batch splitting heuristic for dynamic job shop scheduling problem
โœ Hanil Jeong; Sangbok Woo; Sukho Kang; Jinwoo Park ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 391 KB

The job shop scheduling problem has been a major target for many researchers. Unfortunately, though, most of the past studies assumed that a job consists of only a single part. If we assume that a job consists of a batch as in many real manufacturing environment, then we can obtain an improved sched