Showing 1 - 10 of 2,891
Persistent link: https://www.econbiz.de/10015049216
Heuristics based on dispatching rules are still widely used in practice as methods for effective scheduling systems … implementing novel dispatching rules into twostage heuristics in order to solve group scheduling problems in a job shop … manufacturing cell. By a comprehensive simulation study these heuristics are evaluated and compared to established effective …
Persistent link: https://www.econbiz.de/10011891978
In this paper we address the scheduling problem that comes from an ice cream manufacturing company. This production system can be modelled as a three stage nowait hybrid flow shop with batch dependent setup costs. To contribute reducing the gap between theory and practice we have considered the...
Persistent link: https://www.econbiz.de/10011898585
lower bounds as well as nine efficient heuristics for solving the problem with the objective of minimizing makespan. The … a constraint-free mathematical presentation for this problem. We explore performance measures of makespan and total … randomly generated instances indicates that GVNS outperforms other heuristics. The performance of proposed heuristics and meta-heuristics …
Persistent link: https://www.econbiz.de/10012029504
Persistent link: https://www.econbiz.de/10012316363
intensely challenges real time adaptive production scheduling and control. Indeed, many of the most popular heuristics continue …
Persistent link: https://www.econbiz.de/10014036083
summarize the main body of knowledge on lot streaming in a flow-shop with makespan criteria and, translate this into a form that …
Persistent link: https://www.econbiz.de/10011902778
We present an approximation method for the hybrid flow shop scheduling problem based on relaxation and machine learning techniques. Our model combines a suitable relaxation of the objective function to a continuous solution space with a self-supervised learning method for neural networks, which...
Persistent link: https://www.econbiz.de/10014514881
Motivated by the application of scheduling a sequence of locks along a waterway, we consider a scheduling problem where multiple parallel batching machines are arranged in a sequence and process jobs that travel along this sequence. We investigate the computational complexity of this problem....
Persistent link: https://www.econbiz.de/10012978830
Persistent link: https://www.econbiz.de/10012421529