|
|
|
|
|
Nesrine Touafek, Fatima Benbouzid-Si Tayeb and Asma Ladj
In the last decades, the availability constraint as well as learning and deteriorating effects were introduced into the production scheduling theory to simulate real-world case studies and to overcome the limitation of the classical models. To the best o...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christophe Sauvey and Nathalie Sauer
Since its creation by Nawaz, Enscore, and Ham in 1983, NEH remains the best heuristic method to solve flowshop scheduling problems. In the large body of literature dealing with the application of this heuristic, it can be clearly noted that results diffe...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jose M. Framinan and Rainer Leisten
The goal of manufacturing scheduling is to allocate a set of jobs to the machines in the shop so these jobs are processed according to a given criterion (or set of criteria). Such criteria are based on properties of the jobs to be scheduled (e.g., their ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Felipe Borreiro Sanches, Mauricio Iwama Takano, Marcelo Seido Nagano
Pág. 321 - 326
This paper has the objective to evaluate the use of different methods to obtain an initial solution for the branch and bound algorithm with the objective of minimizing the makespan in a flowshop with zero buffer environment. As the problem is known to be...
ver más
|
|
|
|
|
|
|
|
|
|
|
Pei-Chann Chang, Shih-Hsin Chen and Chen-Ha
Pág. 762 - 771
|
|
|
|
|
|
|
|
|
|
|
Bor-Wen Cheng and Chun-Lang
Pág. 415 - 421
|
|
|
|
|
|
|
|
|
|
|
Milind Dawande, Srinagesh Gavirneni and Ram Rachamadugu
Pág. 73 - 84
|
|
|
|
|
|
|
|
|
|
|
Cheng, T C E; Wang, G
Pág. 187 - 189
|
|
|
|
|
|
|
|
|
|
|
Sethi, S P; Zhang, Q; Zhou, X Y
Pág. 1 - 13
|
|
|
|
|
|