Refine
Year of publication
- 2014 (6) (remove)
Document Type
Language
- English (6) (remove)
Has Fulltext
- no (6)
Is part of the Bibliography
- no (6)
Keywords
- Hierarchische Produktionsplanung (3)
- clearing functions (3)
- Flow-shop-Problem (2)
- Ablaufplanung (1)
- Algorithm design and analysis (1)
- Arrays (1)
- Auftragsabwicklung (1)
- BUSINESS forecasting (1)
- CUDA <Informatik> (1)
- FILDES (1)
Institute
In Book Reviews, we review an extensive and diverse range of books. They cover theory and applications in operations research, statistics, management science, econometrics, mathematics, computers, and information systems. In addition, we include books in other fields that emphasize technical applications. The editor will be pleased to receive an e-mail from those willing to review a book, with an indication of specific areas of interest. If you are aware of a specific book that you would like to review, or that you think should be reviewed, please contact the editor.
Genetic algorithm with simulation for scheduling of a flow shop with simultaneously loaded stations
(2014)
In this study, a real world flow shop with a transportation restriction is regarded. This restriction reduces the set of feasible schedules even more than the no-buffer restrictions discussed in the literature in the case of limited storage. Still this problem is NP-hard. Since this scheduling problem is integrated in the usual hierarchical planning, the tardiness is minimised. Compared to even specific priority rule for this class of problems the suggested genetic algorithm delivers significant better results. The specific structure of this class of problems complicates the calculation of the performance criteria. This is solved by a simulation algorithm. Proceedings 28th European Conference on Modelling and Simulation.
This research aims to develop a CUDA accelerated NEH algorithm for the permutative flowshop scheduling problem with makespan criterion. NEH has been shown in the literature as the best constructive heuristic for this particular problem. The CUDA based NEH aims to speed up the processing time by utilising the GPU cores for parallel evaluation. In order to show the versatility and scalability of the CUDA based NEH, four new higher dimensional Taillard sets are generated. The experiments are conducted on the CPU and GPU and pairwise compared. Percentage relative difference and paired t-test both confirm that the GPU based NEH significantly improves on the execution time compared to the sequential CPU version for all the high dimensional problem instances.
Single-stage capacitated lot-sizing problems (CLSP) are essential for manyplanning tasks in production systems. Due to the hierarchical planning approach, which is widely used in industrial practice and implemented in commercial enterprise resource planning as well as production planning and controlsystems, a subsequent scheduling is necessary to gain executable productionplans. Capacity consumption depends on many factors as, for example, systems workload, machine availability, or yield. Thus, a feasible and optimalsolution of the CLSP may lead to unplanned delays after sequencing and processing the orders on the shop floor. Using a so called clearing function (CF),which represents the relationship between the workload and the output of a production system, this capacity consumption in a CLSP is improved in various ways and tested on a real-world application.