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

The just-in-time scheduling problem in a flow-shop scheduling system

โœ Scribed by Dvir Shabtay

Book ID
113583795
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
510 KB
Volume
216
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The maximum deviation just-in-time sched
The maximum deviation just-in-time scheduling problem
โœ N. Brauner; Y. Crama ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

This note revisits the maximum deviation just-in-time (MDJIT) scheduling problem previously investigated by Steiner and Yeomans. Its main result is a set of algebraic necessary and su cient conditions for the existence of a MDJIT schedule with a given objective function value. These conditions are u

Antithetic sequence in flow shop schedul
Antithetic sequence in flow shop scheduling
โœ Muhammad A. Azim; Rafael G. Moras; Milton L. Smith ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 421 KB
A tabu search approach for the flow shop
A tabu search approach for the flow shop scheduling problem
โœ M. Ben-Daya; M. Al-Fawzan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 788 KB

In this paper, we propose a tabu search approach for solving the permutation flow shop scheduling problem. The proposed implementation of the tabu search approach suggests simple techniques for generating neighborhoods of a given sequence and a combined scheme for intensification and diversification