Diversity of Processing Times in Permutation Flow Shop Scheduling Problems
- 25 September 2020
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Operations Research Proceedings
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Reduction of permutation flowshop problems to single machine problems using machine dominance relationsComputers & Operations Research, 2017
- Minimizing the total waiting time of intermediate products in a manufacturing processInternational Transactions in Operational Research, 2016
- SchedulingPublished by Springer Science and Business Media LLC ,2016
- On heuristic solutions for the stochastic flowshop scheduling problemEuropean Journal of Operational Research, 2015
- New hard benchmark for flowshop scheduling problems minimising makespanEuropean Journal of Operational Research, 2015
- A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing timesSimulation Modelling Practice and Theory, 2014
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm PerformanceINFORMS Journal on Computing, 2002
- A genetic algorithm for flowshop sequencingComputers & Operations Research, 1995
- Benchmarks for basic scheduling problemsEuropean Journal of Operational Research, 1993
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyAnnals of Discrete Mathematics, 1979