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

An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs

โœ Scribed by Hatem Hadda; Najoua Dridi; Sonia Hajri-Gabouj

Publisher
Springer
Year
2009
Tongue
English
Weight
258 KB
Volume
8
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Heuristics for two-machine no-wait flows
Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
โœ Guoqing Wang; T.C.Edwin Cheng ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 75 KB

In this paper we study the two-machine no-wait flowshop problem with an availability constraint. The problem has been shown to be NP-hard, and some heuristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a w

Machine scheduling with an availability
Machine scheduling with an availability constraint and job delivery coordination
โœ Xiuli Wang; T. C. Edwin Cheng ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 145 KB

## Abstract In this paper we study the scheduling problem that considers both production and job delivery at the same time with machine availability considerations. Only one vehicle is available to deliver jobs in a fixed transportation time to a distribution center. The vehicle can load at most __

Genetic algorithms for the job-shop sche
Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence
โœ Fatima Ghedjati ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 360 KB

In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (Cmax). We propose an